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

researchr

You are not signed in
Sign in
Sign up

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.

This author has not been identified. Look up 'Jérôme Waldispühl' in GoogleThis author has not been identified. Look up 'Behshad Behzadi' in GoogleThis author has not been identified. Look up 'Jean-Marc Steyaert' in Google

runs on WebDSL