A Linear Size Index for Approximate Pattern Matching

2006 ◽  
pp. 49-59 ◽  
Author(s):  
Ho-Leung Chan ◽  
Tak-Wah Lam ◽  
Wing-Kin Sung ◽  
Siu-Lung Tam ◽  
Swee-Seong Wong
Keyword(s):  
Pattern Matching ◽  
Linear Size ◽  
Approximate Pattern Matching ◽  
Size Index

scholarly journals A linear size index for approximate pattern matching

2011 ◽  
Vol 9 (4) ◽  
pp. 358-364 ◽  
Author(s):  
Ho-Leung Chan ◽  
Tak-Wah Lam ◽  
Wing-Kin Sung ◽  
Siu-Lung Tam ◽  
Swee-Seong Wong
Keyword(s):  
Pattern Matching ◽  
Linear Size ◽  
Approximate Pattern Matching ◽  
Size Index

scholarly journals Computing quality scores and uncertainty for approximate pattern matching in geospatial semantic graphs

2015 ◽  
Vol 8 (5-6) ◽  
pp. 340-352 ◽  
Author(s):  
David J. Stracuzzi ◽  
Randy C. Brost ◽  
Cynthia A. Phillips ◽  
David G. Robinson ◽  
Alyson G. Wilson ◽  
...  
Keyword(s):  
Pattern Matching ◽  
Approximate Pattern Matching

scholarly journals State Complexity of Neighbourhoods and Approximate Pattern Matching

2018 ◽  
Vol 29 (02) ◽  
pp. 315-329 ◽  
Author(s):  
Timothy Ng ◽  
David Rappaport ◽  
Kai Salomaa
Keyword(s):  
Lower Bound ◽  
Pattern Matching ◽  
Finite Automaton ◽  
The State ◽  
Worst Case ◽  
State Complexity ◽  
Approximate Pattern Matching ◽  
The Given ◽  
Nondeterministic Finite Automaton ◽  
Distance Formula

The neighbourhood of a language [Formula: see text] with respect to an additive distance consists of all strings that have distance at most the given radius from some string of [Formula: see text]. We show that the worst case deterministic state complexity of a radius [Formula: see text] neighbourhood of a language recognized by an [Formula: see text] state nondeterministic finite automaton [Formula: see text] is [Formula: see text]. In the case where [Formula: see text] is deterministic we get the same lower bound for the state complexity of the neighbourhood if we use an additive quasi-distance. The lower bound constructions use an alphabet of size linear in [Formula: see text]. We show that the worst case state complexity of the set of strings that contain a substring within distance [Formula: see text] from a string recognized by [Formula: see text] is [Formula: see text].

scholarly journals Rarity and exponentiality: an extension of Keilson's theorem, with applications

2005 ◽  
Vol 42 (02) ◽  
pp. 393-406
Author(s):  
Rudolf Grübel ◽  
Marcus Reich
Keyword(s):  
Molecular Biology ◽  
Pattern Matching ◽  
Limit Distribution ◽  
Rare Events ◽  
Waiting Times ◽  
Urn Models ◽  
Regenerative Processes ◽  
Approximate Pattern Matching

We generalize a theorem due to Keilson on the approximate exponentiality of waiting times for rare events in regenerative processes. We use the result to investigate the limit distribution for a family of first entrance times in a sequence of Ehrenfest urn models. As a second application, we consider approximate pattern matching, a problem arising in molecular biology and other areas.

Sign in / Sign up

Export Citation Format

Share Document