Browse

An approach of orthology detection from homologous sequences under minimum evolution

DC Field Value Language
dc.contributor.authorKim, Kyung Mo-
dc.contributor.authorSung, Samsun-
dc.contributor.authorCaetano-Anolle´ s, Gustavo-
dc.contributor.authorHan, Jae Yong-
dc.contributor.authorKim, Heebal-
dc.date.accessioned2017-01-25T09:16:30Z-
dc.date.available2017-01-25T09:16:30Z-
dc.date.issued2008-
dc.identifier.citationNucleic Acids Research, vol.36 no.17, e110ko_KR
dc.identifier.issn0305-1048-
dc.identifier.urihttps://hdl.handle.net/10371/100259-
dc.descriptionThis is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/
by-nc/2.0/uk/) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.
ko_KR
dc.description.abstractIn the field of phylogenetics and comparative
genomics, it is important to establish orthologous
relationships when comparing homologous
sequences. Due to the slight sequence dissimilarity
between orthologs and paralogs, it is prone to
regarding paralogs as orthologs. For this reason,
several methods based on evolutionary distance,
phylogeny and BLAST have tried to detect orthologs
with more precision. Depending on their algorithmic
implementations, each of these methods
sometimes has increased false negative or false
positive rates. Here, we developed a novel algorithm
for orthology detection that uses a distance
method based on the phylogenetic criterion of minimum
evolution. Our algorithm assumes that sets
of sequences exhibiting orthologous relationships
are evolutionarily less costly than sets that include
one or more paralogous relationships. Calculation
of evolutionary cost requires the reconstruction
of a neighbor-joining (NJ) tree, but calculations are
unaffected by the topology of any given NJ tree.
Unlike tree reconciliation, our algorithm appears
free from the problem of incorrect topologies of
species and gene trees. The reliability of the algorithm
was tested in a comparative analysis with two
other orthology detection methods using 95 manually
curated KOG datasets and 21 experimentally
verified EXProt datasets. Sensitivity and specificity
estimates indicate that the concept of minimum
evolution could be valuable for the detection of orthologs.
ko_KR
dc.language.isoenko_KR
dc.publisherOxford University Pressko_KR
dc.titleAn approach of orthology detection from homologous sequences under minimum evolutionko_KR
dc.typeArticleko_KR
dc.contributor.AlternativeAuthor김경모-
dc.contributor.AlternativeAuthor성삼순-
dc.contributor.AlternativeAuthor한재용-
dc.contributor.AlternativeAuthor김희발-
dc.identifier.doi10.1093/nar/gkn485-
Appears in Collections:
College of Agriculture and Life Sciences (농업생명과학대학)Dept. of Food and Animal Biotechnology (식품·동물생명공학부)Journal Papers (저널논문_식품·동물생명공학부)
Files in This Item:
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse