CPM
2005
Springer
14 years 7 months ago
2005
Springer
Two equal length strings, or two equal sized two-dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two-...
CPM
2005
Springer
14 years 7 months ago
2005
Springer
Gene structure prediction is one of the most important problems in computational molecular biology. It involves two steps: the first is finding the evidence (e.g. predicting spl...
CPM
2005
Springer
14 years 7 months ago
2005
Springer
Abstract. The Knuth-Morris-Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the...
CPM
2005
Springer
14 years 7 months ago
2005
Springer
CPM
2005
Springer
14 years 7 months ago
2005
Springer
CPM
2005
Springer
14 years 7 months ago
2005
Springer
CPM
2005
Springer
14 years 7 months ago
2005
Springer
A square is the concatenation of two identical non-empty strings. Let S be the input string which is given character by character. Let m be the (unknown) smallest integer such that...
CPM
2005
Springer
14 years 7 months ago
2005
Springer
CPM
2005
Springer
14 years 7 months ago
2005
Springer
CPM
2005
Springer
14 years 7 months ago
2005
Springer
