Increasing Sequence Search Sensitivity with Transitive Alignments
By Ketil Malde, T. Furmanek. 2013
5 citations recorded by the source corpus.
Sequence alignment is an important bioinformatics tool for identifying homology, but searching against the full set of available sequences is likely to result in many hits to poorly annotated sequences providing very little information. Consequently, we often want alignments against a specific subset of sequences: for instance, we are looking for sequences from a particular species, sequences that have known 3d-structures, sequences that have a reliable (curated) function annotation, and so on. Although such subset databases are readily available, they only represent a small fraction of all sequences. Thus, the likelihood of finding close homologs for query sequences is smaller, and the alignments will in general have lower scores. This makes it difficult to distinguish hits to homologous sequences from random hits to unrelated sequences. Here, we propose a method that addresses this problem by first aligning query sequences against a large database representing the corpus of known sequences, and then constructing indirect (or transitive) alignments by combining the results with alignments from the large database against the desired target database. We compare the results to direct pairwise alignments, and show that our method gives us higher sensitivity alignments against the target database.
Subfields: Molecular Biology
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Molecular Biology
- Hongzhan Huang
- Cathy H. Wu
- Yuqi Wang
- Baris E. Suzek
- Peter B. McGarvey
- The UniProt Consortium
- UniProt Consortium
- Burkhard Rost
Citations in the corpus
- UniRef clusters: a comprehensive and scalable alternative for improving sequence similarity searches (2014, background): “Malde and Furmanek (2013) showed that using UniRef50 as an intermediate database can increase sequence search sensitivity when compared with directly searching the target database.”