Sciweavers

166 search results - page 7 / 34
» Suffix trees for very large genomic sequences
Sort
View
CPM
1999
Springer
144views Combinatorics» more  CPM 1999»
14 years 24 days ago
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
Strahil Ristov, Eric Laporte
BMCBI
2006
129views more  BMCBI 2006»
13 years 8 months ago
Fast index based algorithms and software for matching position specific scoring matrices
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....
Michael Beckstette, Robert Homann, Robert Giegeric...
JCB
2006
124views more  JCB 2006»
13 years 8 months ago
The Average Common Substring Approach to Phylogenomic Reconstruction
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
Igor Ulitsky, David Burstein, Tamir Tuller, Benny ...
BNCOD
2003
91views Database» more  BNCOD 2003»
13 years 10 months ago
Persistent Indexing Technology for Large Sequences
There are two aspects to the work being presented here. The first is a novel persistent index structure for genomic data, a prototype of which has been completed. The second, usin...
Robert Japp
ISMB
1997
13 years 10 months ago
Inferring Gene Structures in Genomic Sequences Using Pattern Recognition and Expressed Sequence Tags
Abstract.) Ying Xu, Richard J. MuraF, and Edward C. Uberbacher Computer Science and Mathematics Division and tLife Sciences Division Computational methods for gene identification ...
Ying Xu, Richard J. Mural, Edward C. Uberbacher