Sciweavers

166 search results - page 3 / 34
» Suffix trees for very large genomic sequences
Sort
View
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
14 years 8 months ago
Genome-scale disk-based suffix tree indexing
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...
Benjarath Phoophakdee, Mohammed J. Zaki
JACM
2006
112views more  JACM 2006»
13 years 8 months ago
Linear work suffix array construction
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
Juha Kärkkäinen, Peter Sanders, Stefan B...
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
13 years 8 days ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi
BMCBI
2004
126views more  BMCBI 2004»
13 years 8 months ago
Visualising very large phylogenetic trees in three dimensional hyperbolic space
Background: Common existing phylogenetic tree visualisation tools are not able to display readable trees with more than a few thousand nodes. These existing methodologies are base...
Timothy Hughes, Young Hyun, David A. Liberles
WWW
2007
ACM
14 years 9 months ago
A new suffix tree similarity measure for document clustering
In this paper, we propose a new similarity measure to compute the pairwise similarity of text-based documents based on suffix tree document model. By applying the new suffix tree ...
Hung Chim, Xiaotie Deng