An FPT Algorithm for STRING-TO-STRING CORRECTION

Simple item page
dc.contributor.authorLee-Cultura, Serena Glyn
dc.contributor.supervisorStege, Ulrike
dc.contributor.supervisorSerra, Micaela
dc.date.accessioned2011-08-24T23:23:32Z
dc.date.available2011-08-24T23:23:32Z
dc.date.copyright2011en_US
dc.date.issued2011-08-24
dc.degree.departmentDepartment of Computer Science
dc.degree.levelMaster of Science M.Sc.en_US
dc.description.abstractParameterized string correction decision problems investigate the possibility of transforming a given string X into a target string Y using a fixed number of edit operations, k. There are four possible edit operations: swap, delete, insert and substi- tute. In this work we consider the NP--complete STRING-TO-STRING CORREC- TION problem restricted to deletes and swaps and parameterized by the number of allowed operations. Specifically, the problem asks whether there exists a trans- formation from X into Y consisting of at most k deletes or swaps. We present a fixed parameter algorithm that runs in O(2k(k + m)), where m is the length of the destination string. Further, we present an implementation of an extended version of the algorithm that constructs the transformation sequence ! of length ay most k, given its existence. This thesis concludes with a discussion comparing the practical run times obtained from our implementation with the proposed theoretical results. Efficient string correction algorithms have applications in several areas, for example computational linguistics, error detection and correction, and computational biology.en_US
dc.description.scholarlevelGraduateen_US
dc.identifier.bibliographicCitationF.N. Abu-Khzam, H. Fernau, M.A. Langston, S. Lee-Cultura, and U. Stege. Charge and reduce: A fixed-parameter algorithm for string-to-string correction. Discrete Optimization, 8(1):41-49, 2011en_US
dc.identifier.bibliographicCitationF.N. Abu-Khzam, H. Fernau, M.A. Langston, S. Lee-Cultura, and U. Stege. A fixed-parameter algorithm for string-to-string correction. In Proceedings of the 16th Computing: the Australasian Theory Symposium (CATS), volume 109 of Conferences in Research and Practices in Information Technology CRPIT, pages 31-37, 2010en_US
dc.identifier.urihttp://hdl.handle.net/1828/3498
dc.languageEnglisheng
dc.language.isoenen_US
dc.rights.tempAvailable to the World Wide Weben_US
dc.subjectString Correctionen_US
dc.subjectSwaps and Deletesen_US
dc.subjectfpt Algorithmen_US
dc.titleAn FPT Algorithm for STRING-TO-STRING CORRECTIONen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Lee-Cultura_Serena_MSc_2011.pdf
Size:
1.64 MB
Format:
Adobe Portable Document Format
Description:
An FPT Algorithm for STRING-TO-STRING CORRECTION
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.74 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Electronic Theses and Dissertations (ETD)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.