CPM
2006
Springer
13 years 8 months ago
2006
Springer
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
CPM
2006
Springer
13 years 8 months ago
2006
Springer
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...
CPM
2006
Springer
13 years 8 months ago
2006
Springer
CPM
2006
Springer
13 years 8 months ago
2006
Springer
CPM
2006
Springer
13 years 8 months ago
2006
Springer
CPM
2006
Springer
13 years 8 months ago
2006
Springer
Given an ordered labeled forest F ("the target forest") and an ordered labeled forest G ("the pattern forest"), the most similar subforest problem is to find a ...
CPM
2006
Springer
13 years 8 months ago
2006
Springer
A single logical entity can be referred to by several different names over a large text corpus. We present our algorithm for finding all suchco-reference sets in a large corpus. Ou...
CPM
2006
Springer
13 years 8 months ago
2006
Springer
CPM
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
CPM
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...