## Discrete Pattern Matching Over Sequences And Interval Sets (1993)

Citations: | 2 - 0 self |

### BibTeX

@TECHREPORT{Knight93discretepattern,

author = {James Robert Knight},

title = {Discrete Pattern Matching Over Sequences And Interval Sets},

institution = {},

year = {1993}

}

### OpenURL

### Abstract

Finding matches, both exact and approximate, between a sequence of symbols A and a pattern P has long been an active area of research in algorithm design. Some of the more well-known byproducts from that research are the diff program and grep family of programs. These problems form a sub-domain of a larger areas of problems called discrete pattern matching which has been developed recently to characterise the wide range of pattern matching problems. This dissertation presents new algorithms for discrete pattern matching over sequences and develops a new sub-domain of problems called discrete pattern matching over interval sets. The problems and algorithms presented here are characterised by pattern matching over interval sets. The problems and al

### Citations

3940 |
Introduction to Automata Theory, Languages, and Computation
- Hopcroft, Ullman
- 1979
(Show Context)
Citation Context ...81] [MM85] [Mye86] Common Subsequence [Hir75] [AHU76] [HS77] [NKY82] [HL87] [CP90] [Ste92] [Ukk85] [Fic84] [SK83] [FS83] [HD80] [MP80] [WSB76] [WF74] [Sel74b] Extended Reg. Exp. Pat. Matching [Hir89] =-=[HU79]-=- [MM89a] [WS78] [Wag74] Chapter 3 [HU79] [Tho68] [MY60] [Moo56] [Kle56] [Mea55] [CP92] [Mye88] [GG88] [LV88] [LV89] [LVN89] [GL89] [CL90] [Mye90] [JTU91] [BYP92] [CL92] Figure 1.1: The various problem... |

1535 | Identification of common molecular subsequences - Smith, Waterman - 1981 |

1473 |
A general method applicable to the search for similarities in the amino acid sequence of two proteins
- NEEDLEMAN, WUNSCH
- 1970
(Show Context)
Citation Context ...t84a] [Tay84] [Got82] [MM88b] [Wil88] k Differences Problem [AE86b] [WL83] [GK82] [Sel80] [Got87] [WE87] [PL88] [AGM+90] [HM91] Local Alignments [Oom91] [Tic84] [AC75] [Mey85] [KST92] Problem [Vin68] =-=[NW70]-=- [VZ70] [SC71] [San72] [RCW73] [Hat74] [Sel74a] [SWF81] [MM85] [Mye86] Common Subsequence [Hir75] [AHU76] [HS77] [NKY82] [HL87] [CP90] [Ste92] [Ukk85] [Fic84] [SK83] [FS83] [HD80] [MP80] [WSB76] [WF74... |

1086 |
Improved tools for biological sequence comparison
- Pearson, Lipman
- 1988
(Show Context)
Citation Context ...g Approximate Reg. Exp. Pat. Matching [CHM93] [CPM92] [Epp90] [MM89b] [GP89] [GG89] [AE86a] [Wat84a] [Tay84] [Got82] [MM88b] [Wil88] k Differences Problem [AE86b] [WL83] [GK82] [Sel80] [Got87] [WE87] =-=[PL88]-=- [AGM+90] [HM91] Local Alignments [Oom91] [Tic84] [AC75] [Mey85] [KST92] Problem [Vin68] [NW70] [VZ70] [SC71] [San72] [RCW73] [Hat74] [Sel74a] [SWF81] [MM85] [Mye86] Common Subsequence [Hir75] [AHU76]... |

690 | M.J.: The string-to-string correction problem - Wagner, Fischer - 1974 |

672 | An efficient context-free parsing algorithm - Earley - 1970 |

649 |
Fast pattern matching in strings
- Morris, Pratt
- 1977
(Show Context)
Citation Context ...ults, are placed in an alignment-graph/dynamic-programming framework which simplifies much of the algorithms' complexity and links these results back to the simple edit distance and LCS solutions. 10 =-=[KMP77]-=- [Hor80] [Sun90] [HS91] [Rai92] [Smi92] Keyword Matching SC w/ Extended Operations Sequence Scoring Gap Penalty SC w/ Reg. Exp. Pat. Matching Approximate Reg. Exp. Pat. Matching [CHM93] [CPM92] [Epp90... |

593 | A fast string searching algorithm - Boyer, Moore - 1977 |

550 |
Efficient string matching: An aid to bibliographic search
- Aho, Corasick
- 1975
(Show Context)
Citation Context ...pp90] [MM89b] [GP89] [GG89] [AE86a] [Wat84a] [Tay84] [Got82] [MM88b] [Wil88] k Differences Problem [AE86b] [WL83] [GK82] [Sel80] [Got87] [WE87] [PL88] [AGM+90] [HM91] Local Alignments [Oom91] [Tic84] =-=[AC75]-=- [Mey85] [KST92] Problem [Vin68] [NW70] [VZ70] [SC71] [San72] [RCW73] [Hat74] [Sel74a] [SWF81] [MM85] [Mye86] Common Subsequence [Hir75] [AHU76] [HS77] [NKY82] [HL87] [CP90] [Ste92] [Ukk85] [Fic84] [S... |

393 |
An improved algorithm for matching biological sequences
- Gotoh
- 1982
(Show Context)
Citation Context ...atching SC w/ Extended Operations Sequence Scoring Gap Penalty SC w/ Reg. Exp. Pat. Matching Approximate Reg. Exp. Pat. Matching [CHM93] [CPM92] [Epp90] [MM89b] [GP89] [GG89] [AE86a] [Wat84a] [Tay84] =-=[Got82]-=- [MM88b] [Wil88] k Differences Problem [AE86b] [WL83] [GK82] [Sel80] [Got87] [WE87] [PL88] [AGM+90] [HM91] Local Alignments [Oom91] [Tic84] [AC75] [Mey85] [KST92] Problem [Vin68] [NW70] [VZ70] [SC71] ... |

380 |
Representation of Events in Nerve Nets and Finite Automata
- Kleene
- 1956
(Show Context)
Citation Context ...HL87] [CP90] [Ste92] [Ukk85] [Fic84] [SK83] [FS83] [HD80] [MP80] [WSB76] [WF74] [Sel74b] Extended Reg. Exp. Pat. Matching [Hir89] [HU79] [MM89a] [WS78] [Wag74] Chapter 3 [HU79] [Tho68] [MY60] [Moo56] =-=[Kle56]-=- [Mea55] [CP92] [Mye88] [GG88] [LV88] [LV89] [LVN89] [GL89] [CL90] [Mye90] [JTU91] [BYP92] [CL92] Figure 1.1: The various problems and solutions on discrete pattern matching of sequences. 11 The secon... |

279 |
A linear space algorithm for computing maximal common subsequences
- Hirschberg
- 1975
(Show Context)
Citation Context ...] [WE87] [PL88] [AGM+90] [HM91] Local Alignments [Oom91] [Tic84] [AC75] [Mey85] [KST92] Problem [Vin68] [NW70] [VZ70] [SC71] [San72] [RCW73] [Hat74] [Sel74a] [SWF81] [MM85] [Mye86] Common Subsequence =-=[Hir75]-=- [AHU76] [HS77] [NKY82] [HL87] [CP90] [Ste92] [Ukk85] [Fic84] [SK83] [FS83] [HD80] [MP80] [WSB76] [WF74] [Sel74b] Extended Reg. Exp. Pat. Matching [Hir89] [HU79] [MM89a] [WS78] [Wag74] Chapter 3 [HU79... |

243 |
On the theory and computation of evolutionary distances
- Sellers
- 1974
(Show Context)
Citation Context ...VZ70] [SC71] [San72] [RCW73] [Hat74] [Sel74a] [SWF81] [MM85] [Mye86] Common Subsequence [Hir75] [AHU76] [HS77] [NKY82] [HL87] [CP90] [Ste92] [Ukk85] [Fic84] [SK83] [FS83] [HD80] [MP80] [WSB76] [WF74] =-=[Sel74b]-=- Extended Reg. Exp. Pat. Matching [Hir89] [HU79] [MM89a] [WS78] [Wag74] Chapter 3 [HU79] [Tho68] [MY60] [Moo56] [Kle56] [Mea55] [CP92] [Mye88] [GG88] [LV88] [LV89] [LVN89] [GL89] [CL90] [Mye90] [JTU91... |

219 | Derivatives of regular expressions
- Brzozowski
- 1964
(Show Context)
Citation Context ...ct, the only solutions to the approximate matching problem under the set-theoretic definition appear to include either a cross-product technique, i.e. taking the cross-product of the state sets as in =-=[Brz64]-=-, or a generative technique where the matches to the sub-expressions are generated in order of score. Both of these techniques contain an exponential time factor. Under a slightly less restrictive, re... |

219 | A technique for computer detection and correction of spelling errors - Damerau - 1964 |

195 |
Algorithms for approximate string matching
- Ukkonen
- 1985
(Show Context)
Citation Context ...91] [Tic84] [AC75] [Mey85] [KST92] Problem [Vin68] [NW70] [VZ70] [SC71] [San72] [RCW73] [Hat74] [Sel74a] [SWF81] [MM85] [Mye86] Common Subsequence [Hir75] [AHU76] [HS77] [NKY82] [HL87] [CP90] [Ste92] =-=[Ukk85]-=- [Fic84] [SK83] [FS83] [HD80] [MP80] [WSB76] [WF74] [Sel74b] Extended Reg. Exp. Pat. Matching [Hir89] [HU79] [MM89a] [WS78] [Wag74] Chapter 3 [HU79] [Tho68] [MY60] [Moo56] [Kle56] [Mea55] [CP92] [Mye8... |

190 | EĆcient Parsing for Natural Language - Tomita - 1986 |

181 | Algorithms for the longest common subsequence problem - Hirschberg - 1977 |

178 |
A Fast Algorithm for Computing Longest Common Subsequences
- HUNT, SZYMANSKI
- 1977
(Show Context)
Citation Context ...[AGM+90] [HM91] Local Alignments [Oom91] [Tic84] [AC75] [Mey85] [KST92] Problem [Vin68] [NW70] [VZ70] [SC71] [San72] [RCW73] [Hat74] [Sel74a] [SWF81] [MM85] [Mye86] Common Subsequence [Hir75] [AHU76] =-=[HS77]-=- [NKY82] [HL87] [CP90] [Ste92] [Ukk85] [Fic84] [SK83] [FS83] [HD80] [MP80] [WSB76] [WF74] [Sel74b] Extended Reg. Exp. Pat. Matching [Hir89] [HU79] [MM89a] [WS78] [Wag74] Chapter 3 [HU79] [Tho68] [MY60... |

177 |
A faster algorithm for computing string edit distance
- Masek, Paterson
- 1980
(Show Context)
Citation Context ...oblem [Vin68] [NW70] [VZ70] [SC71] [San72] [RCW73] [Hat74] [Sel74a] [SWF81] [MM85] [Mye86] Common Subsequence [Hir75] [AHU76] [HS77] [NKY82] [HL87] [CP90] [Ste92] [Ukk85] [Fic84] [SK83] [FS83] [HD80] =-=[MP80]-=- [WSB76] [WF74] [Sel74b] Extended Reg. Exp. Pat. Matching [Hir89] [HU79] [MM89a] [WS78] [Wag74] Chapter 3 [HU79] [Tho68] [MY60] [Moo56] [Kle56] [Mea55] [CP92] [Mye88] [GG88] [LV88] [LV89] [LVN89] [GL8... |

161 | Recognition and Parsing of Context-Free Languages in Time n3. Information and Control, 10(2): 189-208. A Translating a TAG into a simple LPDA We assume that the tag has been translated into a DC program as described in section 2. We now translate this DC - Younger - 1967 |

152 | The Theory of Parsing, Translation and Compiling - Aho, Ullman - 1973 |

152 |
Gedanken-Experiments on Sequential Machines
- Moore
- 1956
(Show Context)
Citation Context ...NKY82] [HL87] [CP90] [Ste92] [Ukk85] [Fic84] [SK83] [FS83] [HD80] [MP80] [WSB76] [WF74] [Sel74b] Extended Reg. Exp. Pat. Matching [Hir89] [HU79] [MM89a] [WS78] [Wag74] Chapter 3 [HU79] [Tho68] [MY60] =-=[Moo56]-=- [Kle56] [Mea55] [CP92] [Mye88] [GG88] [LV88] [LV89] [LVN89] [GL89] [CL90] [Mye90] [JTU91] [BYP92] [CL92] Figure 1.1: The various problems and solutions on discrete pattern matching of sequences. 11 T... |

137 | Approximate string matching
- Hall, Dowling
- 1980
(Show Context)
Citation Context ...T92] Problem [Vin68] [NW70] [VZ70] [SC71] [San72] [RCW73] [Hat74] [Sel74a] [SWF81] [MM85] [Mye86] Common Subsequence [Hir75] [AHU76] [HS77] [NKY82] [HL87] [CP90] [Ste92] [Ukk85] [Fic84] [SK83] [FS83] =-=[HD80]-=- [MP80] [WSB76] [WF74] [Sel74b] Extended Reg. Exp. Pat. Matching [Hir89] [HU79] [MM89a] [WS78] [Wag74] Chapter 3 [HU79] [Tho68] [MY60] [Moo56] [Kle56] [Mea55] [CP92] [Mye88] [GG88] [LV88] [LV89] [LVN8... |

123 |
Regular expression search algorithm
- Thompson
- 1968
(Show Context)
Citation Context ...AHU76] [HS77] [NKY82] [HL87] [CP90] [Ste92] [Ukk85] [Fic84] [SK83] [FS83] [HD80] [MP80] [WSB76] [WF74] [Sel74b] Extended Reg. Exp. Pat. Matching [Hir89] [HU79] [MM89a] [WS78] [Wag74] Chapter 3 [HU79] =-=[Tho68]-=- [MY60] [Moo56] [Kle56] [Mea55] [CP92] [Mye88] [GG88] [LV88] [LV89] [LVN89] [GL89] [CL90] [Mye90] [JTU91] [BYP92] [CL92] Figure 1.1: The various problems and solutions on discrete pattern matching of ... |

123 |
Rapid similarity searches of nucleic acid and protein data banks
- Wilbur, Lipman
- 1983
(Show Context)
Citation Context ... Penalty SC w/ Reg. Exp. Pat. Matching Approximate Reg. Exp. Pat. Matching [CHM93] [CPM92] [Epp90] [MM89b] [GP89] [GG89] [AE86a] [Wat84a] [Tay84] [Got82] [MM88b] [Wil88] k Differences Problem [AE86b] =-=[WL83]-=- [GK82] [Sel80] [Got87] [WE87] [PL88] [AGM+90] [HM91] Local Alignments [Oom91] [Tic84] [AC75] [Mey85] [KST92] Problem [Vin68] [NW70] [VZ70] [SC71] [San72] [RCW73] [Hat74] [Sel74a] [SWF81] [MM85] [Mye8... |

119 | An efficient recognition and syntax analysis algorithm for context free languages - Kasami - 1965 |

118 |
A time-efficient, linear-space local similarity algorithm
- Huang, Miller
- 1991
(Show Context)
Citation Context ...g. Exp. Pat. Matching [CHM93] [CPM92] [Epp90] [MM89b] [GP89] [GG89] [AE86a] [Wat84a] [Tay84] [Got82] [MM88b] [Wil88] k Differences Problem [AE86b] [WL83] [GK82] [Sel80] [Got87] [WE87] [PL88] [AGM+90] =-=[HM91]-=- Local Alignments [Oom91] [Tic84] [AC75] [Mey85] [KST92] Problem [Vin68] [NW70] [VZ70] [SC71] [San72] [RCW73] [Hat74] [Sel74a] [SWF81] [MM85] [Mye86] Common Subsequence [Hir75] [AHU76] [HS77] [NKY82] ... |

112 | Practical fast searching in strings
- Horspool
- 1980
(Show Context)
Citation Context ...e placed in an alignment-graph/dynamic-programming framework which simplifies much of the algorithms' complexity and links these results back to the simple edit distance and LCS solutions. 10 [KMP77] =-=[Hor80]-=- [Sun90] [HS91] [Rai92] [Smi92] Keyword Matching SC w/ Extended Operations Sequence Scoring Gap Penalty SC w/ Reg. Exp. Pat. Matching Approximate Reg. Exp. Pat. Matching [CHM93] [CPM92] [Epp90] [MM89b... |

109 |
A very fast substring search algorithm
- Sunday
- 1990
(Show Context)
Citation Context ... in an alignment-graph/dynamic-programming framework which simplifies much of the algorithms' complexity and links these results back to the simple edit distance and LCS solutions. 10 [KMP77] [Hor80] =-=[Sun90]-=- [HS91] [Rai92] [Smi92] Keyword Matching SC w/ Extended Operations Sequence Scoring Gap Penalty SC w/ Reg. Exp. Pat. Matching Approximate Reg. Exp. Pat. Matching [CHM93] [CPM92] [Epp90] [MM89b] [GP89]... |

107 |
A Method for Synthesizing Sequential Circuits
- Mealy
- 1955
(Show Context)
Citation Context ...P90] [Ste92] [Ukk85] [Fic84] [SK83] [FS83] [HD80] [MP80] [WSB76] [WF74] [Sel74b] Extended Reg. Exp. Pat. Matching [Hir89] [HU79] [MM89a] [WS78] [Wag74] Chapter 3 [HU79] [Tho68] [MY60] [Moo56] [Kle56] =-=[Mea55]-=- [CP92] [Mye88] [GG88] [LV88] [LV89] [LVN89] [GL89] [CL90] [Mye90] [JTU91] [BYP92] [CL92] Figure 1.1: The various problems and solutions on discrete pattern matching of sequences. 11 The second half o... |

100 |
From regular expressions to deterministic automata
- Berry, Sethi
- 1986
(Show Context)
Citation Context ...ally equivalent as R 0 (complement of R) equals \Sigma \Gamma R and R \Gamma S equals R&S 0 . Despite its long history, few papers have tackled the matching of extended regular expressions. One paper =-=[BS86]-=- actually considered the exact matching problem and then remarked that it could not be solved using the algorithms described in the paper. Only two efficient algorithms have appeared for the exact mat... |

96 |
Regular expressions and state graphs for automata
- McNaughton, Yamada
- 1960
(Show Context)
Citation Context ...HS77] [NKY82] [HL87] [CP90] [Ste92] [Ukk85] [Fic84] [SK83] [FS83] [HD80] [MP80] [WSB76] [WF74] [Sel74b] Extended Reg. Exp. Pat. Matching [Hir89] [HU79] [MM89a] [WS78] [Wag74] Chapter 3 [HU79] [Tho68] =-=[MY60]-=- [Moo56] [Kle56] [Mea55] [CP92] [Mye88] [GG88] [LV88] [LV89] [LVN89] [GL89] [CL90] [Mye90] [JTU91] [BYP92] [CL92] Figure 1.1: The various problems and solutions on discrete pattern matching of sequenc... |

95 |
A sublinear algorithm for approximate keyword searching
- Myers
- 1994
(Show Context)
Citation Context ...WF74] [Sel74b] Extended Reg. Exp. Pat. Matching [Hir89] [HU79] [MM89a] [WS78] [Wag74] Chapter 3 [HU79] [Tho68] [MY60] [Moo56] [Kle56] [Mea55] [CP92] [Mye88] [GG88] [LV88] [LV89] [LVN89] [GL89] [CL90] =-=[Mye90]-=- [JTU91] [BYP92] [CL92] Figure 1.1: The various problems and solutions on discrete pattern matching of sequences. 11 The second half of the dissertation develops a new domain of problems called super-... |

91 |
Control flow analysis
- Allen
- 1970
(Show Context)
Citation Context ...restricted to the set of DAG edges is acyclic. Moreover, it can be shown that any cycle-free path in F has at most one back edge. Graphs with this property are commonly referred to as being reducible =-=[All70]-=- or as having a loop connectedness parameter of 1 [HU75]. In summary, the key observations are that for any regular expression P there is an NFA whose graph is reducible and whose size, measured in ei... |

89 | A string matching algorithm fast on the average - Commentz-Walter - 1979 |

82 | An Improved Context-Free Recognizer - Graham, Harrison, et al. - 1980 |

81 | An improved algorithm for approximate string matching - Galil, Park - 1989 |

75 |
Prediction of gene structure
- Guigo, Knudsen, et al.
- 1992
(Show Context)
Citation Context ...dure. Less work has been done on integrating these subrecognizers into an overall gene recognizer. The current methods involve hand coded search procedures [FS90], backtracking tree-search algorithms =-=[GKDS92]-=-, and context-sensitive, definite clause grammars [Sea89]. These techniques 56 CAAT/TATA box: intron exon exon exon intron Exon/Intron Seq.: CAP/Poly-a Sites: Start/Stop Codon: 3' 5' 5' 3' 5'/3' Splic... |

75 |
The String-to-String Correction Problem with Block Moves
- Tichy
- 1984
(Show Context)
Citation Context ...PM92] [Epp90] [MM89b] [GP89] [GG89] [AE86a] [Wat84a] [Tay84] [Got82] [MM88b] [Wil88] k Differences Problem [AE86b] [WL83] [GK82] [Sel80] [Got87] [WE87] [PL88] [AGM+90] [HM91] Local Alignments [Oom91] =-=[Tic84]-=- [AC75] [Mey85] [KST92] Problem [Vin68] [NW70] [VZ70] [SC71] [San72] [RCW73] [Hat74] [Sel74a] [SWF81] [MM85] [Mye86] Common Subsequence [Hir75] [AHU76] [HS77] [NKY82] [HL87] [CP90] [Ste92] [Ukk85] [Fi... |

67 | Bounds on the complexity of the longest common subsequenee problem
- Aho, Hirschberg, et al.
- 1976
(Show Context)
Citation Context ... [PL88] [AGM+90] [HM91] Local Alignments [Oom91] [Tic84] [AC75] [Mey85] [KST92] Problem [Vin68] [NW70] [VZ70] [SC71] [San72] [RCW73] [Hat74] [Sel74a] [SWF81] [MM85] [Mye86] Common Subsequence [Hir75] =-=[AHU76]-=- [HS77] [NKY82] [HL87] [CP90] [Ste92] [Ukk85] [Fic84] [SK83] [FS83] [HD80] [MP80] [WSB76] [WF74] [Sel74b] Extended Reg. Exp. Pat. Matching [Hir89] [HU79] [MM89a] [WS78] [Wag74] Chapter 3 [HU79] [Tho68... |

66 | Sequence comparison with concave weighting functions - Miller, Myers - 1988 |

62 | A file comparison program
- Miller, Myers
- 1985
(Show Context)
Citation Context ...E86b] [WL83] [GK82] [Sel80] [Got87] [WE87] [PL88] [AGM+90] [HM91] Local Alignments [Oom91] [Tic84] [AC75] [Mey85] [KST92] Problem [Vin68] [NW70] [VZ70] [SC71] [San72] [RCW73] [Hat74] [Sel74a] [SWF81] =-=[MM85]-=- [Mye86] Common Subsequence [Hir75] [AHU76] [HS77] [NKY82] [HL87] [CP90] [Ste92] [Ukk85] [Fic84] [SK83] [FS83] [HD80] [MP80] [WSB76] [WF74] [Sel74b] Extended Reg. Exp. Pat. Matching [Hir89] [HU79] [MM... |

62 |
Approximate Matching of Regular Expressions
- Myers, Miller
- 1989
(Show Context)
Citation Context ...85] [Mye86] Common Subsequence [Hir75] [AHU76] [HS77] [NKY82] [HL87] [CP90] [Ste92] [Ukk85] [Fic84] [SK83] [FS83] [HD80] [MP80] [WSB76] [WF74] [Sel74b] Extended Reg. Exp. Pat. Matching [Hir89] [HU79] =-=[MM89a]-=- [WS78] [Wag74] Chapter 3 [HU79] [Tho68] [MY60] [Moo56] [Kle56] [Mea55] [CP92] [Mye88] [GG88] [LV88] [LV89] [LVN89] [GL89] [CL90] [Mye90] [JTU91] [BYP92] [CL92] Figure 1.1: The various problems and so... |

57 |
Data structures and algorithms for approximate string matching
- Galil, Giancarlo
- 1988
(Show Context)
Citation Context ...ic84] [SK83] [FS83] [HD80] [MP80] [WSB76] [WF74] [Sel74b] Extended Reg. Exp. Pat. Matching [Hir89] [HU79] [MM89a] [WS78] [Wag74] Chapter 3 [HU79] [Tho68] [MY60] [Moo56] [Kle56] [Mea55] [CP92] [Mye88] =-=[GG88]-=- [LV88] [LV89] [LVN89] [GL89] [CL90] [Mye90] [JTU91] [BYP92] [CL92] Figure 1.1: The various problems and solutions on discrete pattern matching of sequences. 11 The second half of the dissertation dev... |

56 | The Longest Common Subsequence problem revisited - Apostolico, Guerra - 1987 |

56 |
Matching Sequences Under Deletion/Insertion Constraints
- Sankoff
- 1972
(Show Context)
Citation Context ... [MM88b] [Wil88] k Differences Problem [AE86b] [WL83] [GK82] [Sel80] [Got87] [WE87] [PL88] [AGM+90] [HM91] Local Alignments [Oom91] [Tic84] [AC75] [Mey85] [KST92] Problem [Vin68] [NW70] [VZ70] [SC71] =-=[San72]-=- [RCW73] [Hat74] [Sel74a] [SWF81] [MM85] [Mye86] Common Subsequence [Hir75] [AHU76] [HS77] [NKY82] [HL87] [CP90] [Ste92] [Ukk85] [Fic84] [SK83] [FS83] [HD80] [MP80] [WSB76] [WF74] [Sel74b] Extended Re... |

55 | Fast and practical approximate string matching
- Baeza-Yates, Perleberg
- 1996
(Show Context)
Citation Context ...xtended Reg. Exp. Pat. Matching [Hir89] [HU79] [MM89a] [WS78] [Wag74] Chapter 3 [HU79] [Tho68] [MY60] [Moo56] [Kle56] [Mea55] [CP92] [Mye88] [GG88] [LV88] [LV89] [LVN89] [GL89] [CL90] [Mye90] [JTU91] =-=[BYP92]-=- [CL92] Figure 1.1: The various problems and solutions on discrete pattern matching of sequences. 11 The second half of the dissertation develops a new domain of problems called super-pattern matching... |

53 |
Some biological sequence metrics
- Waterman, Smith, et al.
- 1976
(Show Context)
Citation Context ...Vin68] [NW70] [VZ70] [SC71] [San72] [RCW73] [Hat74] [Sel74a] [SWF81] [MM85] [Mye86] Common Subsequence [Hir75] [AHU76] [HS77] [NKY82] [HL87] [CP90] [Ste92] [Ukk85] [Fic84] [SK83] [FS83] [HD80] [MP80] =-=[WSB76]-=- [WF74] [Sel74b] Extended Reg. Exp. Pat. Matching [Hir89] [HU79] [MM89a] [WS78] [Wag74] Chapter 3 [HU79] [Tho68] [MY60] [Moo56] [Kle56] [Mea55] [CP92] [Mye88] [GG88] [LV88] [LV89] [LVN89] [GL89] [CL90... |

51 | T.G.: A minimum distance error-correcting parser for context-free languages - Aho, Peterson - 1972 |