This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Data Structure for Circular String Analysis and Visualization
August 1993 (vol. 42 no. 8)
pp. 992-997

A csdawg for circular strings, which is obtained by making simple modifications to the compact symmetric directed acyclic word graph (csdawg) for linear strings, is proposed. This data structure does not contain extraneous vertices and, consequently, avoids the disadvantages of previous methods. Using this method, algorithms which make use of the csdawg for linear strings can then be extended to circular strings with trivial modifications. The extended algorithms continue to have the same time and space complexities. Moreover, the extensions take the form of postprocessing or preprocessing steps which are simple to add on to a system built for linear strings, particularly in an object-oriented language.

[1] D. Mehta and S. Sahni, "Models and techniques for the visualization of labeled discrete objects," inProc. 1992 ACM/SIGAPP Symp. Applied Computing, 1992, pp. 1224-1233.
[2] D. Mehta and S. Sahni, "Computing display conflicts in string visualization," Univ. Florida, Tech. Rep. 91-024, 1991.
[3] B. Clift, D. Haussler, T. D. Schneider, and G. D. Stormo, "Sequence landscapes,"Nucleic Acids Res., vol. 14, no. 1, pp. 141-158, 1986.
[4] G. M. Morris, "The matching of protein sequences using color intrasequence homology displays,"J. Mol. Graphics, vol. 6, pp. 135-142, 1988.
[5] S. L. Tanimoto, "A method for detecting structure in polygons,"Pattern Recognition, vol. 13, no. 6, pp. 389-394, 1981.
[6] A. Blumer, J. Blumer, D. Haussler, R. McConnell, and A. Ehrenfeucht, "Complete inverted files for efficient text retrieval and analysis,"J. ACM, vol. 34, no. 3, pp. 578-595, 1987.
[7] A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. T. Chen, and J. Seiferas, "The smallest automaton recognizing the subwords of a text,"Theoretical Comput. Sci., no. 40, pp. 31-55, 1985.
[8] M. E. Majster and A. Reiser, "Efficient on-line construction and correction of position trees,"SIAM J. Comput., vol. 9, pp. 785-807, Nov. 1980.
[9] E. McCreight, "A space-economical suffix tree construction algorithm,"J. ACM, vol. 23, pp. 262-272, Apr. 1976.
[10] M. T. Chen and Joel Seiferas, "Efficient and elegant subword tree construction," inCombinatorial Algorithms on Words, NATO ASI Series, vol. F12, A. Apostolico and Z. Galil, Eds. Berlin, Germany: Springer-Verlag, 1985, pp. 97-107.
[11] R.C. Gonzalez and P. Wintz,Digital Image Processing, Addison-Wesley, Reading, Mass., 1987.
[12] Foley, J.D., et al.,Computer Graphics: Principles and Practice, Addison-Wesley, Reading, Mass., 1990.

Index Terms:
time complexity; data structure; circular string analysis; visualization; compact symmetric directed acyclic word graph; space complexities; linear strings; object-oriented language; computational complexity; computational geometry; data structures; data visualisation; directed graphs.
Citation:
D.P. Mehta, S. Sahni, "A Data Structure for Circular String Analysis and Visualization," IEEE Transactions on Computers, vol. 42, no. 8, pp. 992-997, Aug. 1993, doi:10.1109/12.238492
Usage of this product signifies your acceptance of the Terms of Use.