Querying sequence databases with transducers

Acta Informatica

Volumn 36, Issue 7, 2000, Pages 511-544

  Bonner, Anthony J ^a   Mecca, Giansalvatore ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF BASILICATA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034349060     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050001     Document Type: Article

References (32)

1. 1. S. Abiteboul, P. Kanellakis: Object identity as a query language primitive. In: ACM SIGMOD International Conf. on Management of Data, pp. 159-173, 1989
2. 2. W. Ackermann: Zum Hilbertschen Aufbau der reellen Zahlen. Math. Annalen, 99: 118-133 (1928)
3. 2 object-oriented database system. In: Second Intern. Workshop on Database Programming Languages (DBPL'89), pages 122-138 (1989)
4. 4. A.J. Bonner, G. Mecca: Sequences, Datalog and Transducers. J Comput Syst Sci, Special Issue on PODS'95(57): 234-259, 3 (1998) http://www.difa.unibas.it/-users/gmecca
5. 5. R.G.G. Cattel: The Object Database Standard ODMG-93. San Francisco, CA: Morgan Kaufmann, 1994
6. 6. S. Ceri, G. Gottlob, L. Tanca: Logic Programming and Data Bases. Berlin Heidelberg New York: Springer, 1989
7. 7. A.K. Chandra, D. Harel: Computable queries for relational databases. J Comput Syst Sci, 21: 333-347 (1980)
8. 8. J. Collado Vides: The search for a grammatical theory of gene regulation is formally justified by showing the inadequacy of context-free grammars. Computer Application in the Biosciences (CABIOS), 7(3): 321-326 (1991)
9. 9. Communications of the ACM. Special issue on the Human Genome project. Vol. 34(11), November 1991
10. 10. S. Ginsburg, X. Wang: Pattern matching by RS-operations: towards a unified approach to querying sequence data. In: Eleventh ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS'92), pp. 293-300, 1992
11. 11. G.H. Gonnet: Text dominated databases: Theory, practice and experience. Tutorial presented at PODS, 1994
12. 12. N. Goodman: Research issues in Genome databases. Tutorial presented at PODS, 1995
13. 13. G. Grahne, M. Nykanen, E. Ukkonen: Reasoning about strings in databases. In: Thirteenth ACM SIGMOD Intern. Symposium on Principles of Database Systems (PODS'94), pp. 303-312, 1994
14. 14. S. Grumbach, T. Milo: An algebra for POMSETS. In: Fifth International Conference on Data Base Theory, (ICDT'95), Prague, Lecture Notes in Computer Science, Berlin Heidelberg New York: Springer, p 191-207, 1995
15. 15. A. Grzegorczyk: Some classes of recursive functions. Rozprawy Matematyczne, 4, 1953, Instytut Matematyczne Polskiej Akademie Nauk, Warsaw
16. 16. C. Hegelsen, P.R. Sibbald: PALM - a pattern language for molecular biology. In: First Intern. Conference on Intelligent Systems for Molecular Biology, pp. 172-180, 1993
17. 17. J.E. Hopcroft, J.D. Ullman: Introduction to automata theory, languages and computation. Reading, MA: Addison Wesley, 1979
18. 18. V.A. Kozmidiadi: On a generalization of finite automata generating a hierarchy analogous to the A. Grzegorczyk's classification of the primitive recursive functions. Problemi Kibernetiki, 23: 127-170 (1970)
19. 19. J.W. Lloyd: Foundations of Logic Programming. Berlin Heidelberg New York: Springer, 1987.
20. 20. G. Mecca: From Datalog to Sequence Datalog: Languages and Techniques for Querying Sequence Databases. PhD thesis, Universitè di Roma "La Sapienza", Dipartimento di Informatica e Sistemistica, 1996. http://www.difa.unibas.it/users/-gmecca
21. 21. G. Mecca, A.J. Bonner: Finite query languages for sequence databases. In: Fifth Intern. Workshop on Database Programming Languages (DBPL'95), Gubbio, Italy. Electronic Workshops in Computing, Springer-Verlag, 1995, http://www.springer.-co.uk/eWiC/Workshops/DBPL5.html
22. 22. G. Mecca, A.J. Bonner: Sequences, Datalog and Transducers. In: Fourteenth ACM SIGMOD Intern. Symposium on Principles of Database Systems (PODS'95), San Jose, California, pp. 23-35, 1995. http://www.difa.unibas.it/users/gmecca
23. 23. A.R. Meyer, D.M. Ritchie: Computational complexity and program structure. I.B.M. Res. Rep., 1817, 1967
24. 24. C.H. Papadimitriou: Computational Complexity. Reading, MA: Addison-Wesley, 1994
25. 25. H. Rogers, Jr.: Theory of recursive functions and effective computability. Cambridge, MA: MIT Press, 1987
26. 26. D.B. Searls: Representing genetic information with formal grammars. Proc of the Nat. Conf. of the American Association for Artificial Intelligence, 7: 386-391 (1988)
27. 27. D.B. Searls: String Variable Grammars: a logic grammar formalism for dna sequences. Technical report, University of Pennsylvania, School of Medicine, 1993
28. 28. D.B. Searls: The computational linguistics of biological sequences. In: L. Hunter (ed) Artificial Intelligence and Molecular Biology, p 47-120. AAAI Press, 1994
29. 29. L.J. Stockmeyer, A.R. Meyer: Word problems requiring exponential time. In: Proc. of 5th ACM Symposium on the Theory of Computing (STOC'73), pp. 1-9, 1973
30. 30. D. Stott Parker, E. Simon, P. Valduriez: SVP - a model capturing sets, streams and parallelism. In: Eighteenth International Conference on Very Large Data Bases (VLDB'92), Vancouver, Canada, pp. 115-126, 1992
31. 31. M. Vardi: The complexity of relational query languages. In: Fourteenth ACM SIGACT Symp. on Theory of Computing, pp. 137-146, 1988
32. 32. J.D.Watson: Molecular biology of the gene. Menlo Park, CA: Benjamin and Cummings, 1987