64 search results - page 7 / 13 » Finding approximate tandem repeats in genomic sequences |
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Millions of DNA sequences (reads) are generated by Next Generation Sequencing machines everyday. There is a need for high performance algorithms to map these sequences to the refer...
RECOMB
2006
Springer
14 years 8 months ago
2006
Springer
It is well known that the base composition along eukaryotic genomes is long-range correlated. Here, we investigate the effect of such long-range correlations on alignment score sta...
BMCBI
2010
13 years 8 months ago
2010
Background: With the rapid expansion of DNA sequencing databases, it is now feasible to identify relevant information from prior sequencing projects and completed genomes and appl...
BMCBI
2007
13 years 8 months ago
2007
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
JDA
2008
13 years 7 months ago
2008
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...