|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| D.P. Mehta, S. Sahni, "Computing Display Conflicts in String Visualization," IEEE Transactions on Computers, vol. 43, no. 3, pp. 350-361, March, 1994. | |||
| BibTex | x | ||
| @article{ 10.1109/12.272435, author = {D.P. Mehta and S. Sahni}, title = {Computing Display Conflicts in String Visualization}, journal ={IEEE Transactions on Computers}, volume = {43}, number = {3}, issn = {0018-9340}, year = {1994}, pages = {350-361}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.272435}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Computing Display Conflicts in String Visualization IS - 3 SN - 0018-9340 SP350 EP361 EPD - 350-361 A1 - D.P. Mehta, A1 - S. Sahni, PY - 1994 KW - data visualisation; directed graphs; display conflicts; string visualization; DNA sequences; text; numerical sequences. VL - 43 JA - IEEE Transactions on Computers ER - | |||
Strings are used to represent a variety of objects such as DNA sequences, text, and numerical sequences. A model for a system for the visualization and analysis of strings was proposed by D. Mehta and S. Sahni (1992). The problem of display conflicts that arise in this model was identified and methods to overcome it were suggested. These methods require the computation of display conflicts. We present efficient algorithms to compute display conflicts.
[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] B. Clift, D. Haussler, T. D. Schneider, and G. D. Stormo, "Sequence landscapes,"Nucleic Acids Research, vol. 14, no. 1, pp. 141-158, 1986.
[3] G. M. Morris, "The matching of protein sequences using color intrasequence homology displays,"J. Mol. Graphics, vol. 6, pp. 135-142, 1988.
[4] 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.
[5] A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. T. Chen, and J. Seiferas, "The smallest automaton recognizing the subwords of a text,"Theoretical Computer Science, no. 40, pp. 31-55, 1985.
[6] M.E. Majster and A. Reiser, "Efficient on-line construction and correction of position trees,"SIAM J. Computing, vol. 9, pp. 785-807, Nov. 1980.
[7] E. McCreight, "A space-economical suffix tree construction algorithm,"J. ACM, vol. 23, pp. 262-272, Apr. 1976.
[8] M.T. Chen and J. Seiferas, "Efficient and elegant subword tree construction," inCombinatorial Algorithms on Words(NATO ASI Series, vol. F12, pp. 97-107), A. Apostolico and Z. Galil, Eds. Berlin Heidelberg: Springer-Verlag, 1985.
[9] M. Crochemore, "Transducers and repetitions,"Theoretical Computer Science, no. 45, pp. 63-86, 1986.
[10] E. Horowitz and S. Sahni,Fundamentals of Data Structures in Pascal, 3rd Ed. Rockville, MD: Computer Science Press, 1990.
[11] D. Mehta and S. Sahni, "A data structure for circular string analysis and visualization,"IEEE Trans. Comput., vol. 42, no. 8, pp. 992-997, Aug. 1993.