MoBIoS: A metric-space DBMS to support biological discovery

Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM

Volumn 2003-January, Issue , 2003, Pages 241-244

  Miranker, D ^a   Xu, Weijia ^a   Mao, Rui ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Bioinformatics; Biological system modeling; Biology computing; Computational biology; Database systems; Extraterrestrial measurements; Indexing; Proteins; Relational databases; Sequences

Indexed keywords

BIOINFORMATICS; BIOLOGICAL SYSTEMS; COMPUTATIONAL LINGUISTICS; DATABASE SYSTEMS; DIGITAL STORAGE; INDEXING (OF INFORMATION); MANAGEMENT INFORMATION SYSTEMS; PROTEINS; QUERY LANGUAGES; QUERY PROCESSING; RELATIONAL DATABASE SYSTEMS; SEARCH ENGINES; STORAGE MANAGEMENT;

BIOLOGICAL SYSTEM MODELING; BIOLOGY COMPUTING; COMPUTATIONAL BIOLOGY; EXTRATERRESTRIAL MEASUREMENTS; RELATIONAL DATABASE; SEQUENCES;

INFORMATION MANAGEMENT;

EID: 33749589119     PISSN: 10993371     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SSDM.2003.1214987     Document Type: Conference Paper

References (16)

1. Bloch, J. Effective Java, Programming Language Guide. Addison Wesley, 2001
2. Bozkaya T. and Ozsoyoglu M.. Indexing Large Metric Spaces for Similarity Search Queries. Association for Computing Machinery Transactions on Database System, pages 1-34, 1999.
3. Brin, S. 1995. Near Neighbor Search in Large Metric Spaces. In Proc. 21st. Int. Conf. Very Large Data Bases (VLDB), pp. 574-584.
4. Chavez, E., Navarro, G., Baeza-Yatesand R., Marroquin, J. L. 2001. Searching in metric spaces. ACM Computing Surveys 33(3): 273-321.
5. Ciaccia, P., Patella, M. and Zezula, P. 1997. M-tree: an efficient access method for similarity search in metric spaces. Proc. 23rd Int. Conf. Very Large Databases (VLDB).
6. Dayhoff, M. O., Schwartz, R. and Orcutt, B. C. 1978. Atlas of protein sequence and structure 5, Suppl. 3, ed. M. O. Dayhoff
7. Dubuisson, O., translated by Philippe Fouquart. ASN.1 - Communication between heterogeneous systems. Morgan Kaufmann Publishers, September 2000.
8. Giladi, E., Walker, M. G., Wang, J. Z.and Volkmuth, W. 2002. SST: An algorithm for finding near-exact sequence matches in time proportional to the logarithm of the database size. Bioinformatics 18 (6-7): 873-879
9. Gusfield, D. 1997. Algorithms on Str'lings, Trees, and Sequences. Cambridge University Press.
10. Hellerstein, J. M,. Naughton, J. F.and Pfeffer. A., Generalized Search Trees for Database Systems. Proc. 21st Int'l Conf. on Very Large Data Bases, Zürich, September 1995, 562-573.
11. Kent, W. J. 2002. BLAT - the BLAST-like alignment tool. Genome Research 12: 656-664.
12. th International Conference on Intelligent Systems for Molecular Biology, August 3-7, 2002, Edmonton, Canada.
13. Mao, R., Xu, W., Singh, N. and Miranker, D. P.. An Assessment of a Metric Space Database Index to Support Sequence Homology. In the proceeding of the 3rd IEEE Symposium on Bioinformatics and Bioengineering, March 10-12, 2003, Washington D.C
14. Needleman S.B., and Wunsch C.D. A general method applicable to the search for similarities in the amino acid sequence of two proteins. J Mol Biol. 1970 Mar;48(3):443-53.
15. Pevzner P.A., Mulyukov Z, Dancik V, and Tang CL. Efficiency of database search for identification of mutated and modified proteins via mass spectrometry. Genome Res. 2001 Feb;11(2):290-9
16. Smith T.F., and Waterman M.S. Identification of common molecular subsequences. J. Mol. Biol. 1981 Mar 25;147(1):195-7.