Increasing sequence search sensitivity with transitive alignments.

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 subse...

Full description

Bibliographic Details
Main Authors: Ketil Malde, Tomasz Furmanek
Format: Article
Language:English
Published: Public Library of Science (PLoS) 2013-01-01
Series:PLoS ONE
Online Access:http://europepmc.org/articles/PMC3573025?pdf=render
id doaj-c25b86326fa049a18635e6c558e3d44d
record_format Article
spelling doaj-c25b86326fa049a18635e6c558e3d44d2020-11-25T02:09:16ZengPublic Library of Science (PLoS)PLoS ONE1932-62032013-01-0182e5442210.1371/journal.pone.0054422Increasing sequence search sensitivity with transitive alignments.Ketil MaldeTomasz FurmanekSequence 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.http://europepmc.org/articles/PMC3573025?pdf=render
collection DOAJ
language English
format Article
sources DOAJ
author Ketil Malde
Tomasz Furmanek
spellingShingle Ketil Malde
Tomasz Furmanek
Increasing sequence search sensitivity with transitive alignments.
PLoS ONE
author_facet Ketil Malde
Tomasz Furmanek
author_sort Ketil Malde
title Increasing sequence search sensitivity with transitive alignments.
title_short Increasing sequence search sensitivity with transitive alignments.
title_full Increasing sequence search sensitivity with transitive alignments.
title_fullStr Increasing sequence search sensitivity with transitive alignments.
title_full_unstemmed Increasing sequence search sensitivity with transitive alignments.
title_sort increasing sequence search sensitivity with transitive alignments.
publisher Public Library of Science (PLoS)
series PLoS ONE
issn 1932-6203
publishDate 2013-01-01
description 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.
url http://europepmc.org/articles/PMC3573025?pdf=render
work_keys_str_mv AT ketilmalde increasingsequencesearchsensitivitywithtransitivealignments
AT tomaszfurmanek increasingsequencesearchsensitivitywithtransitivealignments
_version_ 1724924908299878400