DocumentCode :
1037109
Title :
Computing display conflicts in string visualization
Author :
Mehta, Dinesh P. ; Sahni, Sartaj
Author_Institution :
Dept. of Comput. Sci., Tennessee Univ. Space Inst., Tullahoma, TN, USA
Volume :
43
Issue :
3
fYear :
1994
fDate :
3/1/1994 12:00:00 AM
Firstpage :
350
Lastpage :
361
Abstract :
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
Keywords :
data visualisation; directed graphs; DNA sequences; display conflicts; numerical sequences; string visualization; text; Biological system modeling; Biology computing; Computer displays; DNA; Data visualization; Helium; Pattern matching; Proteins; Sequences; Text analysis;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/12.272435
Filename :
272435
Link To Document :
بازگشت