Sciweavers

35 search results - page 1 / 7
» A compression algorithm for DNA sequences and its applicatio...
Sort
View
RECOMB
2000
Springer
13 years 8 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
IPPS
2003
IEEE
13 years 10 months ago
A Fast Algorithm for the Exhaustive Analysis of 12-Nucleotide-Long DNA Sequences. Applications to Human Genomics
We have developed a new algorithm that allows the exhaustive determination of words of up to 12 nucleotides in DNA sequences. It is fast enough as to be used at a genomic scale ru...
Vicente Arnau, Ignacio Marín
DNA
2005
Springer
13 years 10 months ago
Two Proteins for the Price of One: The Design of Maximally Compressed Coding Sequences
Abstract. The emerging field of synthetic biology moves beyond conventional genetic manipulation to construct novel life forms which do not originate in nature. We explore the pro...
Bei Wang, Dimitris Papamichail, Steffen Mueller, S...
BMCBI
2006
137views more  BMCBI 2006»
13 years 4 months ago
Chaos game representation for comparison of whole genomes
Background: Chaos game representation of genome sequences has been used for visual representation of genome sequence patterns as well as alignment-free comparisons of sequences ba...
Jijoy Joseph, Roschen Sasikumar
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
13 years 9 months ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...