Issue No.03 - March (1994 vol.43)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.272435
<p>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.</p>
data visualisation; directed graphs; display conflicts; string visualization; DNA sequences; text; numerical sequences.
D.P. Mehta, S. Sahni, "Computing Display Conflicts in String Visualization", IEEE Transactions on Computers, vol.43, no. 3, pp. 350-361, March 1994, doi:10.1109/12.272435