Sciweavers

3 search results - page 1 / 1
» cpm 1993
Sort
View
CPM
1994
Springer
123views Combinatorics» more  CPM 1994»
13 years 8 months ago
Computing all Suboptimal Alignments in Linear Space
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
Kun-Mao Chao
CPM
1993
Springer
125views Combinatorics» more  CPM 1993»
13 years 8 months ago
Detecting False Matches in String Matching Algorithms
Consider a text string of length n, a pattern string of length m, and a match vector of length n which declares each location in the text to be either a mismatch (the pattern does ...
S. Muthukrishnan
CPM
1993
Springer
154views Combinatorics» more  CPM 1993»
13 years 8 months ago
On Suboptimal Alignments of Biological Sequences
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re ect the correct biolog...
Dalit Naor, Douglas L. Brutlag