Buy Structure Comparison in Bioinformatics - Bookswagon
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer science > Structure Comparison in Bioinformatics
Structure Comparison in Bioinformatics

Structure Comparison in Bioinformatics


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

This dissertation, "Structure Comparison in Bioinformatics" by Zeshan, Peng, 彭澤山, was obtained from The University of Hong Kong (Pokfulam, Hong Kong) and is being sold pursuant to Creative Commons: Attribution 3.0 Hong Kong License. The content of this dissertation has not been altered in any way. We have altered the formatting in order to facilitate the ease of printing and reading of the dissertation. All rights not granted by the above license are retained by the author. Abstract: Abstract of thesis entitled "Structure Comparison in Bioinformatics" Submitted by Zeshan PENG for the degree of Doctor of Philosophy at The University of Hong Kong in February 16, 2006 Massive genomic and proteinomic structures have been revealed. All such structures can be categorized into primary structures (one-dimensional sequences), secondary structures (tree oriented structures) and tertiary structures (three-dimensional struc- tures). Thisthesis studiesstructurecomparisonproblemsinBioinformatics forfinding similarities or consensuses of input structures. For primary structure comparisons, we study the problem of online recognition of tandem-repeat-free strings, where a tandem repeat is a string formed by two identical halves and a string without any substring being a tandem repeat is tandem-repeat- free. Wepresentefficientalgorithmsfortheproblemanditsdynamicversions. Wealso study the constrained sequence comparison problem in which an optimal alignment or aconsensusofinputsequencesisreturnedsuchthatitincludesaconstrainedsequence. Space-efficient algorithms ontwo sequences andanapproximate algorithm on multiple sequences are presented. For secondary structure comparisons, we study the Maximum Constrained Agree- ment SubTree (MCAST) problem for phylogenetic analysis of species, where two evolu- tionarytrees, S andT, togetherwithanagreement subtreeofthem, P, areprovidedas inputs, and the objective is to finda Maximum Agreement SubTree (MAST)of S andT such that it includes P as a subtree. A linear time reduction is presented such that the MCAST problem can be solved efficiently by the algorithms for the MAST problem. We study the local forest edit distance problem on two ordered labeled forests, whose objective is to find two most similar subforests of input forests. Efficient dynamic programming algorithms are presented for it. Also we study the constrained forest edit distance problem in which two ordered labeled forests, E and F, and a common subtree of them, G, are provided as inputs, and the objective is to find a sequence ofedit operations with minimum total cost on nodes of E and F such that the resulting forests are identical and include G as a subtree. We present a dynamic programming algorithm for this problem. Fortertiarystructurecomparisons, westudytheproteintertiarystructurecompar- ison problem for finding similar fragments of m input protein tertiary structures. We transform protein triangle representations for finding good superpositions. We build a sequential m-partite graph from m transformed protein structures such that we can find their similar fragments by searching a maximum sequential m-clique matching or a maximum sequential m-star matching. We show that these two matching prob- lems are NP-complete. Furthermore, we present an efficient algorithm for comparing two protein tertiary structures and an efficient heuristic algorithm for comparing m protein tertiary structures. (419 words) DOI: 10.5353/th_b3627129 Subjects: Structural bioinformatics Computational biology


Best Sellers


Product Details
  • ISBN-13: 9781361418239
  • Publisher: Open Dissertation Press
  • Publisher Imprint: Open Dissertation Press
  • Height: 279 mm
  • No of Pages: 156
  • Weight: 658 gr
  • ISBN-10: 1361418230
  • Publisher Date: 27 Jan 2017
  • Binding: Hardback
  • Language: English
  • Spine Width: 11 mm
  • Width: 216 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Structure Comparison in Bioinformatics
Open Dissertation Press -
Structure Comparison in Bioinformatics
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Structure Comparison in Bioinformatics

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!