Computing evolutionary chains in musical sequences.
Crochemore, Maxime, Iliopoulos, Costas S., Pinzon, Yoan J. (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Dynamic programming for reduced NFAs for approximate string and sequence matching”
Computing evolutionary chains in musical sequences.
Application of the Constrained Edit Distance Algorithm to Search Procedures
Vladimir Jovičić, Zora Konjović (1997)
The Yugoslav Journal of Operations Research
Similarity:
SMAL - The symbol manipulation language
Ján Chovanec, Ada Chudá, Eduard Kostolanský, Dušan Ondruš (1973)
Kybernetika
Similarity:
A syntax directed translation algorithm for ALGOL-like languages
Jan Vinař (1966)
Kybernetika
Similarity:
Efficient validation and construction of border arrays and validation of string matching automata
Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre (2009)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We present an on-line linear time and space algorithm to check if an integer array is the border array of at least one string built on a bounded or unbounded size alphabet . First of all, we show a bijection between the border array of a string and the skeleton of the DFA recognizing , called a string matching automaton (SMA). Different strings can have the same border array but the originality of the presented method is that the correspondence between a border array and a skeleton...