2004
DOI: 10.1007/978-3-540-30213-1_9
|View full text |Cite
|
Sign up to set email alerts
|

Permuted and Scaled String Matching

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2010
2010
2010
2010

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…As a result, most recent works in pattern matching have considered 'inexact matching'. Many types of differences have been defined and studied in the literature, namely, errors (Hamming distance [12], LCS [24,25,29,38], edit distance [12,33]), wild cards or don't cares [12,13,19,28,36,37,39], degenerate strings [20,26,40], rotations [3,7], scaling [4,5], permutations [11] among others.…”
Section: Introductionmentioning
confidence: 99%
“…As a result, most recent works in pattern matching have considered 'inexact matching'. Many types of differences have been defined and studied in the literature, namely, errors (Hamming distance [12], LCS [24,25,29,38], edit distance [12,33]), wild cards or don't cares [12,13,19,28,36,37,39], degenerate strings [20,26,40], rotations [3,7], scaling [4,5], permutations [11] among others.…”
Section: Introductionmentioning
confidence: 99%