473 search results - page 13 / 95 » Heapable Sequences and Subsequences |
TCS
2008
14 years 10 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
75
Voted
JCB
2000
14 years 10 months ago
2000
We study the problem of similarity detection by sequence alignment with gaps, using a recently established theoretical framework based on the morphology of alignment paths. Alignm...
CVPR
2008
IEEE
16 years 4 days ago
2008
IEEE
This paper presents a general method for segmenting a vector valued sequence into an unknown number of subsequences where all data points from a subsequence can be represented wit...
83
Voted
IFIP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
106
click to vote
PAKDD
2001
ACM
15 years 2 months ago
2001
ACM
Data clustering methods have many applications in the area of data mining. Traditional clustering algorithms deal with quantitative or categorical data points. However, there exist...