• Swap and mismatch edit distanc...

Treffer: Swap and mismatch edit distance

Title:
Swap and mismatch edit distance
Authors:
AMIR, Amihood, EISENBERG, Estrella, PORAT, Ely
Source:
Twelfth Annual European Symposium on AlgorithmsAlgorithmica. 45(1):109-120
Publisher Information:
New York, NY: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 14 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Appariement chaîne, String matching, Concordance forme, Pattern matching, Distance Hamming, Hamming distance, Distancia Hamming, Texte, Text, Texto, Approximate pattern matching, Edit distance, Swap matching
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science, Bar-Ilan University, 52900 Ramat-Gan, Israel
College of Computing, Georgia Tech, Atlanta, GA 30332, United States
ISSN:
0178-4617
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17872487
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17872487
Database:
PASCAL Archive

Weitere Informationen

There is no known algorithm that solves the general case of the approximate string matching problem with the extended edit distance, where the edit operations are: insertion, deletion, mismatch and swap, in time o(nm), where n is the length of the text and m is the length of the pattern. In an effort to study this problem, the edit operations were analysed independently. It turns out that the approximate matching problem with only the mismatch operation can be solved in time O(nmtogm). If the only edit operation allowed is swap, then the problem can be solved in time O(n log m log σ), where a = min(m, |Σ|). In this paper we show that the approximate string matching problem with swap and mismatch as the edit operations, can be computed in time O(nnlogm).