RECOMB
2000
Springer
13 years 8 months ago
2000
Springer
We present a lossless compression algorithm, GenCompress, for genetic sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for...
GCB
2000
Springer
13 years 8 months ago
2000
Springer
Conventional phylogenetic tree estimation methods assume that all sites in a DNA multiple alignment have the same evolutionary history. This assumption is violated in data sets fro...
CSB
2004
IEEE
13 years 8 months ago
2004
IEEE
We propose derivative Boyer-Moore (d-BM), a new compressed pattern matching algorithm in DNA sequences. This algorithm is based on the BoyerMoore method, which is one of the most ...
HPDC
1994
IEEE
13 years 8 months ago
1994
IEEE
Finding genes unequivocally in DNA sequences is one of the key goals of the Human Genome project. The human genome is a 9 billion character long DNA sequence and is estimated to c...
VISUALIZATION
1996
IEEE
1996
IEEE
Flexible Information Visualization of Multivariate Data from Biological Sequence Similarity Searches
13 years 8 months ago
Information visualization faces challenges presented by the need to represent abstract data and the relationships within the data. Previously, we presented a system for visualizin...
VISUALIZATION
1998
IEEE
13 years 8 months ago
1998
IEEE
This paper presents a tool for the visual exploration of DNA sequences represented as H-curves [7]. Although very long sequences can be plotted using H-curves, micro-features are ...
CSB
2002
IEEE
13 years 9 months ago
2002
IEEE
-- We investigate off-line dictionary oriented approaches to DNA sequence compression, based on the Burrows-Wheeler Transform (BWT). The preponderance of short repeating patterns i...
SOFTCO
2004
Springer
13 years 10 months ago
2004
Springer
The computational identification of genes in DNA sequences has become an issue of crucial importance due to the large number of DNA molecules being currently sequenced. We present ...
WCC
2005
Springer
13 years 10 months ago
2005
Springer
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
WABI
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Traditional sequence comparison by alignment applies a mutation model comprising two events, substitutions and indels (insertions or deletions) of single positions (SI). ...