An approximate matching algorithm for finding (sub-)optimal sequences in S-attributed grammars

Jérôme Waldispühl, Behshad Behzadi, Jean-Marc Steyaert. An approximate matching algorithm for finding (sub-)optimal sequences in S-attributed grammars. In Proceedings of the European Conference on Computational Biology (ECCB 2002), October 6-9, 2002, Saarbrücken, Germnany. pages 250-259, 2002.

Abstract

Abstract is missing.