Abstract
Seed is a type of a regularity of strings. A restricted approximate seed w of string T is a factor of T such that w covers a superstring of T under some distance rule. In this paper, the problem of searching of all restricted seeds with the smallest Hamming distance is studied and a polynomial time and space algorithm for solving the problem is presented. It searches for all restricted approximate seeds of a string with given limited approximation using Hamming distance and it computes the smallest distance for each found seed. The solution is based on a finite (suffix) automata approach that provides a straightforward way to design algorithms to many problems in stringology. Therefore, it is shown that the set of problems solvable using finite automata includes the one studied in this paper.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Christodoulakis, M., Iliopoulos, C.S., Park, K.S., & Sim, J.S. (2005). Approximate seeds of strings. Journal of Automata, Languages and Combinatorics, 10(5/6), 609–626.
Christodoulakis, M., Iliopoulos, C.S., Park, K.S., & Sim, J.S. (2005). Implementing approximate regularities. Mathematical and Computer Modelling, 42, 855–866.
Guth, O., Melichar, B., & Balík, M. (2008). Searching all approximate covers and their distance using finite automata. Information technologies – applications and theory (pp. 21–26). Košice: Univerzita P. J. Šafárika. http://ftp.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-414/paper4.pdf.
Iliopoulos, C.S., Moore, D., & Park, K.S. (1993). Covering a string. CPM ’93: Proceedings of the 4th annual symposium on combinatorial pattern matching (pp. 54–62). London, UK: Springer.
Voráček, M., & Melichar, B. (2006). Computing seeds in generalized strings. Proceedings of workshop 2006 (pp. 138–139). Prague: Czech Technical University.
Acknowledgements
This research was supported by the Czech Technical University in Prague as grant No. CTU0803113 and as grant No. CTU0915313, by the Ministry of Education, Youth and Sports of the Czech Republic under research program MSM 6840770014, and by the Czech Science Foundation as project No. 201/06/1039 and as project No. 201/09/0807.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media B.V.
About this chapter
Cite this chapter
Guth, O., Melichar, B. (2009). Using Finite Automata Approach for Searching Approximate Seeds of Strings. In: Huang, X., Ao, SI., Castillo, O. (eds) Intelligent Automation and Computer Engineering. Lecture Notes in Electrical Engineering, vol 52. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-3517-2_27
Download citation
DOI: https://doi.org/10.1007/978-90-481-3517-2_27
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-3516-5
Online ISBN: 978-90-481-3517-2
eBook Packages: EngineeringEngineering (R0)