Sciweavers

60 search results - page 2 / 12
» Compressing Genomic Sequence Fragments Using SlimGene
Sort
View
RECOMB
2000
Springer
13 years 9 months ago
A compression algorithm for DNA sequences and its applications in genome comparison
We present a lossless compression algorithm, GenCompress, for genetic sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for...
Xin Chen, Sam Kwong, Ming Li
BCB
2010
156views Bioinformatics» more  BCB 2010»
13 years 14 days ago
RepFrag: a graph based method for finding repeats and transposons from fragmented genomes
Growing sequencing and assembly efforts have been met by the advances in high throughput machines. However, the presence of massive amounts of repeats and transposons complicates ...
Nirmalya Bandyopadhyay, A. Mark Settles, Tamer Kah...
RECOMB
2010
Springer
13 years 3 months ago
Novel Definition and Algorithm for Chaining Fragments with Proportional Overlaps
Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a maximum weighted chain with no overlaps allowed between adjacent fragments. In prac...
Raluca Uricaru, Alban Mancheron, Eric Rivals
ISAMI
2010
13 years 3 months ago
Employing Compact Intra-genomic Language Models to Predict Genomic Sequences and Characterize Their Entropy
Probabilistic models of languages are fundamental to understand and learn the profile of the subjacent code in order to estimate its entropy, enabling the verification and predicti...
Sérgio A. D. Deusdado, Paulo Carvalho
BIOCOMP
2007
13 years 6 months ago
xMAN: extreme MApping of oligoNucleotides
Background: The ability to rapidly map millions of oligonucleotide fragments to a reference genome is crucial to many high throughput genomic technologies. Results: We propose an ...
Wei Li, Jason S. Carroll, Myles Brown, X. Shirley ...