Abstract
Strings are used to represent a variety of objects such as DNA sequences, text, and numerical sequences. Circular strings are used to represent circular genomes in molecular biology, polygons in computer graphics and computational geometry, and closed curves in computer vision. We have proposed a model for the visualization of strings and circular strings.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This research was supported in part by the National Science Foundation under grant MIP 91-03379
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
D. Mehta and S. Sahni, “Models and Techniques for the Visualization of Labeled Discrete Objects,” ACM Symposium on Applied Computing, pp. 1224–1233, 1991.
B. Clift, D. Haussler, T.D. Schneider, and G.D. Stormo, “Sequence Landscapes,” Nucleic Acids Research, vol. 14, no. 1, pp. 141–158, 1986.
G.M. Morris, “The Matching of Protein Sequences using Color Intrasequence Homology Displays,” J. Mol. Graphics, vol. 6, pp. 135–142, 1988.
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.
S.L. Tanimoto, “A method for detecting structure in polygons,” Pattern Recognition, vol. 13, no. 6, pp. 389–394, 1981.
A. Blumer, J. Blumer, D. Haussier, A. Ehrenfeucht, M.T. Chen, J. Seiferas, “The Smallest Automaton Recognizing the Subwords of a Text,” Theoretical Computer Science, no. 40, pp. 31–55, 1985.
M. E. Majster and A. Reiser, “Efficient on-line construction and correction of position trees,” SIAM Journal on Computing, vol. 9, pp. 785–807, Nov. 1980.
E. McCreight, “A space-economical suffix tree construction algorithm,” Journal of the ACM, vol. 23, pp. 262–272, Apr. 1976.
M. T. Chen and Joel Seiferas, “Efficient and elegant subword tree construction,” in Combinatorial Algorithms on Words (A. Apostolico and Z. Galil, eds.), NATO ASI Series, Vol. F12, pp. 97–107, Berlin Heidelberg: Springer-Verlag, 1985.
E.Horowitz, S. Sahni, Fundamentals of Data Structures in Pascal, 3'rd Edition. Computer Science Press, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mehta, D.P., Sahni, S. (1992). Computing display conflicts in string and circular string visualization. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds) Combinatorial Pattern Matching. CPM 1992. Lecture Notes in Computer Science, vol 644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56024-6_20
Download citation
DOI: https://doi.org/10.1007/3-540-56024-6_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56024-1
Online ISBN: 978-3-540-47357-2
eBook Packages: Springer Book Archive