Sept. 4, 2006 to Sept. 8, 2006
J?rgen Kleffe , Charit? Berlin, Institut f?r Molekularbiologie und Bioinformatik, Germany
Friedrich M?ller , Charit? Berlin, Institut f?r Molekularbiologie und Bioinformatik, Germany
Burghardt Wittig , Charit? Berlin, Institut f?r Molekularbiologie und Bioinformatik, Germany
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DEXA.2006.40
High throughput sampling of expressed sequence tags (ESTs) has generated huge collections of transcripts that are difficult to compare with each other using existing tools for sequence matching. The major problem is lack of computer memory. We therefore present a new exact and memory efficient algorithm for the simultaneous identification of matching substrings in large sets of sequences. Its application to more than six million human ESTs in Genbank of date 2005-04-06, counting more than 3.3 billion base pairs, takes less than four hours to find all more than seven million clusters of multiple substrings of at least 50 nucleotides in length, say, by using a standard PC with 2 GB of RAM, 2.8 GHz processor speed. The corresponding program ClustDB is able to handle at least eight times more data than VMATCH, the most memory efficient exact software known today. Our program is freely available for academic use. Contact: juergen.kleffe@charite.
J?rgen Kleffe, Friedrich M?ller, Burghardt Wittig, "ClustDB: A High-Performance Tool for Large Scale Sequence Matching", DEXA, 2006, 2012 23rd International Workshop on Database and Expert Systems Applications, 2012 23rd International Workshop on Database and Expert Systems Applications 2006, pp. 196-200, doi:10.1109/DEXA.2006.40