Theoretical Computer Science
Complete inverted files for efficient text retrieval and analysis
Journal of the ACM (JACM)
The matching of protein sequences using color intrasequence homology displays
Journal of Molecular Graphics
Models and techniques for the visualization of labeled discrete objects
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Fundamentals of Data Structures in Pascal
Fundamentals of Data Structures in Pascal
A Data Structure for Circular String Analysis and Visualization
IEEE Transactions on Computers
Visualization and comparison of DNA sequences by use of three-dimensional trajectories
APBC '03 Proceedings of the First Asia-Pacific bioinformatics conference on Bioinformatics 2003 - Volume 19
| Hi-index | 14.98 |
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.