Abstract
Acyclic Subsequence Graph (DASG) is an automaton that accepts all subsequences of a given string T. DASG allows us to decide whether a string S is a subsequence of T in O(|S|) time where |S| is the length of S. We show that if we slightly modify the string T, it is possible to get the DASG for the modified string from the original DASG. For this purpose we define these operations on DASG: adding a state on the left, deleting a state on left, adding a state on the right, deleting a state on the right, adding an inner state, deleting an inner state and replacing a transition label. For each of these operations we describe the modification of DASG and the proof of correctness.
This research has been supported by GAČR grant No. 201/98/1155
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
Preview
Unable to display preview. Download preview PDF.
References
Baeza-Yates, R. A.: Searching subsequences. Theoretical Computer Science 78 (1991), pages 363–378.
Crochemore, M., Rytter, W.: Text algorithms. Oxford University Press, 1994.
Hirschberg, D. S.: A linear space algorithm for computing maximal common subsequences. Communication of ACM, 18(6), 1975, pages 341–343.
Myers, E. W., Miller, W.: Optimal alignments in linear space. Computer Applications in the Biosciences, 4(1), 1988, pages 11–17.
Sankoff, D., Kruskal, J. B.: Time warps, string edits, and macromolecules: the theory and practice of sequence comparison. Addison-Wesley, Reading, MA, 1983.
Troníček, Z., Melichar, B.: Directed acyclic subsequence graph. Prague Stringology Club Workshop, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tronìček, Z. (1999). Operations on DASG. In: Champarnaud, JM., Ziadi, D., Maurel, D. (eds) Automata Implementation. WIA 1998. Lecture Notes in Computer Science, vol 1660. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48057-9_7
Download citation
DOI: https://doi.org/10.1007/3-540-48057-9_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66652-3
Online ISBN: 978-3-540-48057-0
eBook Packages: Springer Book Archive