Algorithms for Next-Generation Sequencing.
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 > Mathematics and Science Textbooks > Biology, life sciences > Algorithms for Next-Generation Sequencing.
Algorithms for Next-Generation Sequencing.

Algorithms for Next-Generation Sequencing.


     0     
5
4
3
2
1



Out of Stock


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

Thirty years ago, Sanger first introduced the gel electrophoresis method for sequencing DNA. Since then, technology has improved to the point where we are adding over 10 billion bases to GenBank each year at a cost of less than 0.1 cents per base. Amazingly, we are now entering an era of even more dramatic sequencing growth thanks to next-generation technologies that will completely dwarf all previous efforts. Although the cost and speed of sequencing will improve by orders of magnitude, the characteristic short read length of such technologies creates new challenges in effectively using the data. In this dissertation, I describe three significant algorithmic contributions I have made for next-generation sequencing: (1) whole-genome short-read sequencing and assembly, (2) bacterial flora-typing using targeted short-read sequencing, and (3) ancestry inference using dense SNP arrays. First, I present SHRAP (SHort Read Assembly Protocol), a sequencing protocol and assembly methodology that uses short-read technologies to decipher complex, mammalian-sized genomes. Our sequencing protocol is based on a variation of hierarchical clone-based sequencing that is optimized for high-throughput implementation using current technologies. We assemble the genome through a series of algorithms that first determines clone ordering in-silico, then performs error correction, and finally assembles localized sets of reads in three stages of hierarchically larger regions. By benchmarking our method on large simulations of the human genome, I demonstrate that it is possible to perform fast and truly inexpensive de novo sequencing of mammalian genomes. Next, I describe the genomic study of microbial communities using next-generation sequencing. I present a methodology for phylogenetic classification based on short, 16S rDNA gene sequence reads and apply the technique to reads obtained via high-throughput Pyrosequencing. I then examine our ability to classify reads at different levels in the phylogeny and discuss limitations of the technique and the effects of read-length and targeting specific 16S variable regions using simulation. Finally, I present HAPAA (HMM-based Analysis of Polymorphisms in Admixed Ancestries), a methodology for inferring the ancestry of chromosomal blocks using dense SNP arrays. I describe how our method improves upon previous techniques by modeling the long-range patterns of haplotypic variation seen in populations due to linkage disequilibrium. Finally, to study the effect of genetic divergence between populations on ancestry inference methods, I will present a testing methodology we devised that constructs synthetic populations and tests on individuals with varied genetic histories. As DNA sequencing technology evolves, it will continue to open up opportunities for new computational approaches for understanding our genetics. The algorithms I present address three such opportunities that exist today with next-generation sequencing.


Best Sellers


Product Details
  • ISBN-13: 9781243565648
  • Publisher: Proquest, Umi Dissertation Publishing
  • Publisher Imprint: Proquest, Umi Dissertation Publishing
  • Height: 246 mm
  • Weight: 213 gr
  • ISBN-10: 1243565640
  • Publisher Date: 01 Sep 2011
  • Binding: Paperback
  • Spine Width: 6 mm
  • Width: 189 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Algorithms for Next-Generation Sequencing.
Proquest, Umi Dissertation Publishing -
Algorithms for Next-Generation Sequencing.
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.

Algorithms for Next-Generation Sequencing.

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!