Sciweavers

18 search results - page 4 / 4
» Counting Suffix Arrays and Strings
Sort
View
JMLR
2008
148views more  JMLR 2008»
13 years 5 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
BMCBI
2008
77views more  BMCBI 2008»
13 years 5 months ago
SeqAn An efficient, generic C++ library for sequence analysis
Background: The use of novel algorithmic techniques is pivotal to many important problems in life science. For example the sequencing of the human genome [1] would not have been p...
Andreas Döring, David Weese, Tobias Rausch, K...
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
13 years 10 months ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...