Querying sequence databases with transducers

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

Volumn 1369 LNCS, Issue , 1998, Pages 118-135

  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

COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; QUERY LANGUAGES; QUERY PROCESSING; SUBROUTINES;

ACKERMANN FUNCTIONS; COMPLEXITY CLASS; COMPUTATIONAL PROPERTIES; DATABASE APPLICATIONS; DATABASE QUERY LANGUAGE; DATALOG PROGRAMS; MACHINE MODELING; SEQUENCE DATABASE;

TRANSDUCERS;

EID: 0039259418     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-64823-2_8     Document Type: Conference Paper

References (29)

1. S. Abiteboul and P. Kanellakis. Object identity as a query language primitive. In ACM SIGMOD International Conf. on Management of Data, pages 159-173, 1989.
2. W. Ackermann. Zum Hilbertschen Aufbau der reellen Zahlen. Math. Annalen, 99:118-133, 1928.
3. K. Apt, H. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89-148. Morgan Kauffman, Los Altos, 1988.
4. 2 object-oriented database system. In Second Intern. Workshop on Database Programming Languages (DBPL'89), pages 122-138, 1989.
5. A. J. Bonner and G. Mecca. Querying string databases with Transducers. http://poincare.inf.uniroma3.it:8080, 1997.
6. A. J. Bonner and G. Mecca. Sequences, Datalog and Transducers. Journal of Computing and System Sciences, Special Issue on PODS'95, 1997. To Appear. http://poincare.inf.uniroma3.it:8080.
7. R. G. G. Cattel. The Object Database Standard ODMG-93. Morgan Kaufmann Publishers, San Francisco, CA, 1994.
8. S. Ceri, G. Gottlob, and L. Tanca. Logic Programming and Data Bases. Springer-Verlag, 1989.
9. A. K. Chandra and D. Harel. Computable queries for relational databases. Journal of Computing and System Sciences, 21:333-347, 1980.
10. Communications of the ACM. Special issue on the Human Genome project, Vol. 34(11), November 1991.
11. S. Ginsburg and 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), pages 293-300, 1992.
12. G. H. Gonnet. Text dominated databases: Theory, practice and experience. Tutorial presented at PODS, 1994.
13. N. Goodman. Research issues in Genome databases. Tutorial presented at PODS, 1995.
14. G. Grahne, M. Nykanen, and E. Ukkonen. Reasoning about strings in databases. In Thirteenth ACM SIGMOD Intern. Symposium on Principles of Database Systems (PODS'94), pages 303-312, 1994.
15. S. Grumbach and T. Milo. An algebra for POMSETS. In Fifth International Conference on Data Base Theory, (ICDT'95), Prague, Lecture Notes in Computer Science, pages 191-207, 1995.
16. A. Grzegorczyk. Some classes of recursive functions. Rozprawy Matematyczne, 4, 1953. Instytut Matematyczne Polskiej Akademie Nauk, Warsaw.
17. C. Hegelsen and P. R. Sibbald. PALM - a pattern language for molecular biology. In First Intern. Conference on Intelligent Systems for Molecular Biology, pages 172-180, 1993.
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. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, second edition, 1987.
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://poincare.inf.-uniroma3.it:8080.
21. G. Mecca and 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/Horkshops/DBPL5.html.
22. G. Mecca and A. J. Bonner. Sequences, Datalog and Transducers. In Fourteenth ACM SIGMOD Intern. Symposium on Principles of Database Systems (PODS'95), San Jose, California, pages 23-35, 1995. http://poincare.inf.- uniroma3.it:8080.
23. A. R. Meyer and D. M. Ritchie. Computational complexity and program structure. I.B.M. Res. Rep., 1817, 1967.
24. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
25. H. Rogers, Jr. Theory of recursive functions and effective computability. MIT Press, Cambridge, Mass., 1987.
26. D. B. Searls. String Variable Grammars: a logic grammar formalism for dna sequences. Technical report, University of Pennsylvania, School of Medicine, 1993.
27. D. Stott Parker, E. Simon, and P. Valduriez. SVP - a model capturing sets, streams and parallelism. In Eighteenth International Conference on Very Large Data Bases (VLDB'92), Vancouver, Canada, pages 115-126, 1992.
28. M. Vardi. The complexity of relational query languages. In Fourteenth ACM SIGA CT Symp. on Theory of Computing, pages 137-146, 1988.
29. J. D. Watson et al. Molecular biology of the gene. Benjamin and Cummings Publ. Co., Menlo Park, California, fourth edition, 1987.