Reporting exact and approximate regular expression matches

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1448 LNCS, Issue , 1998, Pages 91-103

  Myers, Eugene W ^a   Oliva, Paulo ^b   Guimares, Katia ^a  

^a University of Arizona   (United States)

^b FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

APPROXIMATE MATCHES; LONGEST MATCH; REGULAR EXPRESSION PATTERN MATCHING; REGULAR EXPRESSIONS; REGULAR-EXPRESSION MATCHING;

PATTERN MATCHING;

EID: 84877327616     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030783     Document Type: Conference Paper

References (10)

1. C. A. Clarke and G. V. Cormack. On the use of regular expressons for searching text. ACM Trans. on Prog. Languages and Systems, 19(3):413-426, 1997.
2. IEEE. Portable Operating System Interface (POSIX). IEEE Std 1003. 2, Inst. of EE Engineers, New York, 1992.
3. E. Myers and M. Jain. Going against the grain. In Carleton University Press, editor, Proc. 3rd South American Workshop on String Processing, International Informatics Series #4, pages 203-213, 1996.
4. E. Myers and W. Miller. Approximate matching of regular expressions. Bulletin of Mathematical Biology, 51(1):5-37, 1988.
5. J. K. Ousterhout. Tcl and the TK Toolkit. Addison-Wesley, Reading, Mass., 1994.
6. R. Sedgewick. Algorithms. Addison-Wesley, Reading, Mass., 1983.
7. P. H. Sellers. Pattern recognition in genetic sequences by mismatch density. Bulletin of Mathematical Biology, 46:501-514, 1984.
8. T. F. Smith and M. S. Waterman. Identification of common molecular sequence. J. of Molecular Biology, 147:195-197, 1981.
9. K. Thompson. Regular expression search algorithm. Comm. of A CM, 11(6):419-422, 1968.
10. L. Wall and R. L. Schwartz. Programming Perl. O'Reilly and Associates, Sebastopol, Calif., 1991.