74 search results - page 4 / 15 » Improved Approximate String Matching Using Compressed Suffix... |
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
92
Voted
DASFAA
2003
IEEE
15 years 2 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
VLDB
2005
ACM
15 years 2 months ago
2005
ACM
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...
77
Voted
COOPIS
2004
IEEE
15 years 1 months ago
2004
IEEE
Querying and integrating sources of structured data from the Web in most cases requires similarity-based concepts to deal with data level conflicts. This is due to the often errone...
DEXAW
2006
IEEE
15 years 3 months ago
2006
IEEE
: Scalable Distributed Data Structures (SDDSs) store large scalable files over a distributed RAM of nodes in a grid or a P2P network. The files scale transparently for the applicat...