Finite-state computability of annotations of strings and trees

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

Volumn 1075, Issue , 1996, Pages 384-391

  Bodlaender, Hans L ^a   Fellows, Michael R ^b   Evans, Patricia A ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATION THEORY; FORMAL LOGIC; PATTERN MATCHING; TREES (MATHEMATICS);

BIOLOGICAL SEQUENCES; BOUNDED TREEWIDTH; COURCELLE'S THEOREMS; DECISION PROBLEMS; EXISTENTIAL QUANTIFICATIONS; GRAPH PROPERTIES; MONADIC SECOND-ORDER LOGIC; SEQUENCE COMPARISONS;

GRAPH THEORY;

EID: 84957619589     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61258-0_28     Document Type: Conference Paper

References (19)

1. K. Abrahamson and M. Fellows. [AF93] K. Abrahamson and M. Fellows. Finite automata, bounded treewidth and well-quasi-ordering. In: Graph Structure Theory: Proceedings of the Joint Summer Research Conference on Graph Minors, Seattle, June, 1991, American Mathematical Society, Contemporary Mathematics 147 (1993), 539-564.
2. H. Bodlaender. A linear time algorithm for finding tree-decompositions of small width. In Proceedings of the 25th Annual Symposium on Theory of Computing (1993), 226-234. To appear in SIAM J. Comput.
3. B. Courcelle. The monadic second-order logic of graphs l: Recognizable sets of finite graphs. In.formation and Computation 85 (1990), 12-75.
4. F. Corpet and B. Minchot. RNAlign program: alignment of RNA sequences using both primary and secondary structures. Computer Applications in the”Biosciences 10 (1994), 389-399.
5. S. Dong and D. Searls. Gene structure prediction by linguistic methods. Genomics 23 (1994), 540-551.
6. S. Eilenberg. Automata, Languages, and Machines: Volume A. Academic Press, 1974.
7. C. Elgot and J. Mezei. On relations defined by generalized finite automata. IBM Journal of Research 9 (1965), 47-68.
8. K. Hun and H. Kim. Prediction of common folding structures of homologous RNAs. Nucleic Acids Res. 21 (1993), 1251-1257.
9. C. Johnson. Formal Aspects of Phonological Description. Mouton, 1972.
10. R. Kaplan and M. Kay. Regular models of phonological rule systems. Computational Linguistics 20 (1994), 331-378.
11. K. Koskermiemi. Two-level morphology: a general computational model for wordform recognition and production. Ph.D. thesis, University of Helsinki.
12. S. Needleman and C. Wunsch. A general method applicable to the search for similarities in the amino-acid sequence of two proteins. Journal of Molecular Biology 48 (1970), 443-453.
13. B. Rost, R. Schneider, A. de Daruvar, and C. Sander. The PredictProtein server. http://www.embl-heidelberg.de/predictprotein/predictprotein.html
14. D. Searls and S. Dong. A syntactic pattern recognition system for DNA sequences. Proceedings of the Second International Conference on Bioinformatics, Supercomputing, and Complex Genome Analysis (1993), 89-101.
15. D. Searls. The computational linguistics of biological sequences. In Artificial Intelligence and Molecular Biology, AAAI Press, 1993, 47-120.
16. D. Searls. Formal grammars for intermolecular structure. Proceedings of the International IEEE Symposium on Intelligence in Neural and Biological Systems (1995).
17. R. Sproat. Morphology and Computation. MIT Press, 1992.
18. T. Smith and M. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology 147 (1981), 195-197.
19. G. Stephen. String Searching Algorithms. Lecture Notes Series on Computing, vol. 3. World Scientific, 1994.