×

A framework to animate string algorithms. (English) Zbl 0900.68436

Summary: We present an algorithm animation system, Xaa, which is tailored for string algorithms, and, in general, to algorithms that have as input one or two dimensional sequences of symbols. This system provides data generation tools and statistics of the algorithm’s behavior.

MSC:

68U10 Computing methodologies for image processing

Software:

Xaa; SALSA; MacBALSA; Zeus; Tango
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Brown, M. H., Exploring algorithms using Balsa — II, IEEE Comput., 21, 5, 14-36 (1988)
[2] Brown, M. H., Zeus: A system for algorithm animation and multi-view editing, (IEEE Workshop on Visual Languages (1991))
[3] Baeza-Yates, R.; Fuentes, L., Xaa: A framework to animate text algorithms, (Proc. 19th Latinamerican Conf. on Informatics. Proc. 19th Latinamerican Conf. on Informatics, Buenos Aires, Argentina (1993)), 15-22, Software is available at
[4] Baeza-Yates, R.; Jara, L.; Quezada, G., VCC: Automatic animation of C programs, (Proc. COMPUGRAPHICS’92. Proc. COMPUGRAPHICS’92, Lisboa, Portugal (1992)), 389-397
[5] Baeza-Yates, R.; Régnier, M., Fast two dimensional pattern matching, Inform. Process. Lett., 45, 51-57 (1993) · Zbl 0795.68078
[7] Gonnet, G. H.; Baeza-Yates, R., (Handbook of Algorithms and Data Structures — In Pascal and C (1991), Addison-Wesley: Addison-Wesley Wokingham, UK) · Zbl 0719.68001
[8] Sutinen, E.; Tarhio, J., String matching animator salsa, (Proc. 3rd Symp. on Programming Languages and Software Tools. Proc. 3rd Symp. on Programming Languages and Software Tools, Kaariku, Estonia (1993)), 120-129
[9] Stasko, J. T., Tango: A framework and system for algorithm animation, IEEE Comput., 23, 9, 27-39 (1990)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.