Format

Send to

Choose Destination
See comment in PubMed Commons below
J Comput Biol. 2008 May;15(4):357-77. doi: 10.1089/cmb.2007.0105.

Space efficient computation of rare maximal exact matches between multiple sequences.

Author information

1
Faculty of Engineering and Computer Sciences, University of Ulm, Ulm, Germany. enno.ohlebusch@uni-ulm.de

Abstract

In this article, we propose a new method for computing rare maximal exact matches between multiple sequences. A rare match between k sequences S(1), ... , S(k) is a string that occurs at most t(i)-times in the sequence S(i), where the t(i) > 0 are user-defined thresholds. First, the suffix tree of one of the sequences (the reference sequence) is built, and then the other sequences are matched separately against this suffix tree. Second, the resulting pairwise exact matches are combined to multiple exact matches. A clever implementation of this method yields a very fast and space efficient program. This program can be applied in several comparative genomics tasks, such as the identification of synteny blocks between whole genomes.

PMID:
18361760
DOI:
10.1089/cmb.2007.0105
[Indexed for MEDLINE]
PubMed Commons home

PubMed Commons

0 comments
How to join PubMed Commons

    Supplemental Content

    Full text links

    Icon for Mary Ann Liebert, Inc.
    Loading ...
    Support Center