Sciweavers

22 search results - page 2 / 5
» Assembly complexity of prokaryotic genomes using short reads
Sort
View
BMCBI
2010
127views more  BMCBI 2010»
13 years 5 months ago
Deriving enzymatic and taxonomic signatures of metagenomes from short read data
Background: We propose a method for deriving enzymatic signatures from short read metagenomic data of unknown species. The short read data are converted to six pseudo-peptide cand...
Uri Weingart, Erez Persi, Uri Gophna, David Horn
WABI
2007
Springer
139views Bioinformatics» more  WABI 2007»
13 years 11 months ago
Computability of Models for Sequence Assembly
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
Paul Medvedev, Konstantinos Georgiou, Gene Myers, ...
BMCBI
2008
132views more  BMCBI 2008»
13 years 5 months ago
The Average Mutual Information Profile as a Genomic Signature
Background: Occult organizational structures in DNA sequences may hold the key to understanding functional and evolutionary aspects of the DNA molecule. Such structures can also p...
Mark Bauer, Sheldon M. Schuster, Khalid Sayood
BMCBI
2010
183views more  BMCBI 2010»
13 years 5 months ago
SOPRA: Scaffolding algorithm for paired reads via statistical optimization
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
Adel Dayarian, Todd P. Michael, Anirvan M. Sengupt...
BMCBI
2007
151views more  BMCBI 2007»
13 years 5 months ago
Minimus: a fast, lightweight genome assembler
Background: Genome assemblers have grown very large and complex in response to the need for algorithms to handle the challenges of large whole-genome sequencing projects. Many of ...
Daniel D. Sommer, Arthur L. Delcher, Steven L. Sal...