全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
-  2017 

Algorithms for matching partially labelled sequence graphs

DOI: 10.1186/s13015-017-0115-y

Keywords: Phylogenetic tree matching, Correlated substitution analysis, Bipartite graph matching

Full-Text   Cite this paper   Add to My Lib

Abstract:

In order to find correlated pairs of positions between proteins, which are useful in predicting interactions, it is necessary to concatenate two large multiple sequence alignments such that the sequences that are joined together belong to those that interact in their species of origin. When each protein is unique then the species name is sufficient to guide this match, however, when there are multiple related sequences (paralogs) in each species then the pairing is more difficult. In bacteria a good guide can be gained from genome co-location as interacting proteins tend to be in a common operon but in eukaryotes this simple principle is not sufficient

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133