106
Voted
CPM
15 years 2 months ago
2008 Springer 114
Voted
CPM
15 years 2 months ago
2008 Springer
We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is N...
CPM
15 years 2 months ago
2008 Springer
Let G be an unweighted and undirected graph of n nodes, and let D be the n
105
click to vote
CPM
15 years 2 months ago
2008 Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
114
Voted
CPM
15 years 2 months ago
2008 Springer
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...
|