Efficient filtration of sequence similarity search through singular value decomposition

Proceedings - Fourth IEEE Symposium on Bioinformatics and Bioengineering, BIBE 2004

Volumn , Issue , 2004, Pages 403-410

  Aghili, S Alireza ^a   Sahin, Ozgur D ^a   Agrawal, Divyakant ^a   El Abbadi, Amr ^a  

^a University of California   (United States)

Author keywords

Approximate String Search; Bioinformatics; Comparative genomics; Sequence Homology; Singular Value Decomposition

Indexed keywords

APPROXIMATE STRING SEARCH; BIOINFORMATICS; COMPARATIVE GEMOMICS; SEQUENCE HOMOLOGY; SINGULAR VALUE DECOMPOSITION (SVD);

DATA MINING; DATABASE SYSTEMS; DECOMPOSITION; DNA; ERROR ANALYSIS; GENES;

GENETIC ENGINEERING;

EID: 4544342630     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. S.A. Aghili, D. Agrawal and A. EI Abbadi, Filtration of String Proximity Search via Transformation. IEEE International Symposium on BioInformatics and BioEngineering (BIBE), 149-157 (2003).
2. S.A. Aghili, D. Agrawal and A. El Abbadi, BFT: Bit Filtration Technique for Approximate String Join in Biological Databases. String Processing and Information Retrieval (SPIRE) LNCS 2857, 326-340 (2003).
3. O. Alter, P.O. Brown and D. Botstein, Singular Value Decomposition for Genome-wide Expression Data Processing and Modeling. Proceedings of National Academy of Science 97(18), 10101-6 (2000).
4. O. Alter, P.O. Brown and D. Botstein, Generalized Singular Value Decomposition for Comparative Analysis of Genome-scale Expression Datasets of Two Different Organisms. Proceedings of National Academy of Science 100(6), 3351-6 (2003).
5. S.F. Altschul, W. Gish, W. Miller, E.W. Myers and D.J. Lipman, Basic Local Alignment Search Tool. Journal of Molecular Biology 215, 403-410 (1990).
6. A. Apostolico, The Myriad Virtues of Subword Trees. Combinatorial Algorithms on Words, NATO ISI Series, Springer-Verlag, 85-96 (1985).
7. S. Burkhardt et al., q-gram Based Database Searching Using a Suffix Array (QUASAR) RECOMB, 77-83 (1999).
8. E. Chavez and G. Navarro, A Metric Index for Approximate String Matching. Latin American Theoretical INformatics (LATIN), 181-195 (2002).
9. S. Deerwester, S.T. Dumais, G.W. Furnas, T.K. Landauer and R. Harshman, Indexing by Latent Semantic Analysis. Journal of the American Society of Information Science 41(6)), 391-407 (1990).
10. V. Gaede and O. Günther, Multidimensional Access Methods. ACM Computing Surveys 30, 170-231 (1998).
11. E. Giladi et al., SST: An Algorithm for Finding Near-Exact Sequence Matches in Time Proportional to the Logarithm of the Database Size. Bioinformatics 18, 873-877 (2002).
12. L. Gravano et al., Approximate String Joins in a Database (Almost) for Free. Very Large Data Bases Conference, 491-500 (2001).
13. L. Jin et al., Efficient Similarity String Joins in Large Data Sets. UCI ICS Technical Report, TR-DB-02-04 (2002).
14. P. Jokinen and E. Ukkonen, Two Algorithms for Approximate String Matching in Static Texts. Mathematical Foundations of Computer Science (MFCS) 16, 240-248 (1991).
15. T. Kahveci and A.K. Singh, Efficient Index Structures for String Databases. Very Large Data Bases Conference, 351-360 (2001).
16. National Center for Bio. Information (NCBI), http://www.ncbi.nih.gov/.
17. G. Navarro et al., A Hybrid Indexing Method for Approximate String Matching. Journal of Discrete Algorithms 1, 205-239 (2000).
18. G. Navarro et al., Indexing Methods for Approximate String Matching. IEEE Data Engineering Bulletin 24, 19-27 (2001).
19. S.B. Needleman et al., General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins. Journal of Molecular Biology 48, 443-453 (1970).
20. W.R. Pearson, Using the FASTA Program to Search Protein and DNA Sequence Databases. Methods Molecular Biology 24, 307-331 (1994).
21. T.F. Smith et al., Identification of Common Molecular Subsequences. Journal of Molecular Biology 147, 195-197 (1981).