Sciweavers

BMCBI
2011
12 years 7 months ago
Structator: fast index-based search for RNA sequence-structure patterns
Background: The secondary structure of RNA molecules is intimately related to their function and often more conserved than the sequence. Hence, the important task of searching dat...
Fernando Meyer, Stefan Kurtz, Rolf Backofen, Sebas...
SODA
1990
ACM
173views Algorithms» more  SODA 1990»
13 years 4 months ago
Suffix Arrays: A New Method for On-Line String Searches
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
Udi Manber, Gene Myers
ISMB
2000
13 years 5 months ago
Accelerating Protein Classification Using Suffix Trees
Position-specific scoring matrices have been used extensively to recognize highly conserved protein regions. We present a method for accelerating these searches using a suffix tre...
Bogdan Dorohonceanu, Craig G. Nevill-Manning
ACMSE
2006
ACM
13 years 5 months ago
Phoenix-based clone detection using suffix trees
A code clone represents a sequence of statements that are duplicated in multiple locations of a program. Clones often arise in source code as a result of multiple cut/paste operat...
Robert Tairas, Jeff Gray
ESA
1998
Springer
169views Algorithms» more  ESA 1998»
13 years 7 months ago
Augmenting Suffix Trees, with Applications
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
Yossi Matias, S. Muthukrishnan, Süleyman Cenk...
CIKM
2005
Springer
13 years 9 months ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
VLDB
2005
ACM
132views Database» more  VLDB 2005»
14 years 3 months ago
Practical methods for constructing suffix trees
Yuanyuan Tian, Sandeep Tata, Richard A. Hankins, J...
VLDB
2002
ACM
184views Database» more  VLDB 2002»
14 years 3 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
RECOMB
2009
Springer
14 years 4 months ago
Storage and Retrieval of Individual Genomes
A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N. Example...
Gonzalo Navarro, Jouni Sirén, Niko Väl...
ICML
2006
IEEE
14 years 4 months ago
Fast and space efficient string kernels using suffix arrays
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
Choon Hui Teo, S. V. N. Vishwanathan