Digital image processing (2nd ed.)
Digital image processing (2nd ed.)
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
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
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)
Computing Display Conflicts in String Visualization
IEEE Transactions on Computers
| Hi-index | 14.98 |
A csdawg for circular strings, which is obtained by making simple modifications to the compact symmetric directed acyclic word graph (csdawg) for linear strings, is proposed. This data structure does not contain extraneous vertices and, consequently, avoids the disadvantages of previous methods. Using this method, algorithms which make use of the csdawg for linear strings can then be extended to circular strings with trivial modifications. The extended algorithms continue to have the same time and space complexities. Moreover, the extensions take the form of postprocessing or preprocessing steps which are simple to add on to a system built for linear strings, particularly in an object-oriented language.