Super-pattern matching

DOI10.1007/BF01188587zbMath0833.92006OpenAlexW2043834106MaRDI QIDQ1902473

J. R. Knight, Eugene W. Myers

Publication date: 20 March 1996

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01188587

zbMATH Keywords

dynamic programmingmolecular biologypolynomial-time algorithmsDNA sequencingextended regular expressiondiscrete pattern matchinggene recognitionpatterns of patternssuper-pattern matching

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08)

Cites Work

• Unnamed Item
• Approximate matching of regular expressions
• ARIADNE: pattern-directed inference and hierarchical abstraction in protein structure recognition
• A Simple Algorithm for Global Data Flow Analysis Problems
• Correcting Counter-Automaton-Recognizable Languages
• The String-to-String Correction Problem
• Recognition and parsing of context-free languages in time n3
• An efficient context-free parsing algorithm
• Derivatives of Regular Expressions
• Matching Sequences under Deletion/Insertion Constraints

This page was built for publication: Super-pattern matching