Sciweavers

23 search results - page 1 / 5
» PSIST: Indexing Protein Structures Using Suffix Trees
Sort
View
CSB
2005
IEEE
233views Bioinformatics» more  CSB 2005»
13 years 6 months ago
PSIST: Indexing Protein Structures Using Suffix Trees
Feng Gao, Mohammed Javeed Zaki
VLDB
2002
ACM
184views Database» more  VLDB 2002»
14 years 5 months ago
Database indexing for large DNA and protein sequence collections
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
Ela Hunt, Malcolm P. Atkinson, Robert W. Irving
CPM
2006
Springer
125views Combinatorics» more  CPM 2006»
13 years 8 months ago
Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures
Abstract. Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate query data structures for such 3-D structure...
Tetsuo Shibuya
ICDE
2004
IEEE
139views Database» more  ICDE 2004»
14 years 6 months ago
Engineering a Fast Online Persistent Suffix Tree Construction
Online persistent suffix tree construction has been considered impractical due to its excessive I/O costs. However, these prior studies have not taken into account the effects of ...
Srikanta J. Bedathur, Jayant R. Haritsa
TCS
2008
13 years 4 months ago
On-line construction of compact suffix vectors and maximal repeats
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...
Élise Prieur, Thierry Lecroq