%0 Journal Article
%T Algorithms for matching partially labelled sequence graphs
%A William R. Taylor
%J Archive of "Algorithms for Molecular Biology : AMB".
%D 2017
%R 10.1186/s13015-017-0115-y
%X 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
%K Phylogenetic tree matching
%K Correlated substitution analysis
%K Bipartite graph matching
%U https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5613400/