Locality-sensitive hashing without false negatives for lp

Pacuk, Andrzej; Sankowski, Piotr; Wegrzycki, Karol; Wygocki, Piotr
We consider the problem of reconciling gene trees with a species tree based on the widely accepted Gene Duplication model$\backslash$n from Goodman et al. Current algorithms that solve this problem handle only binary gene trees or interpret polytomies in the gene tree as true.$\backslash$n While in practice polytomies occur frequently, they are typically not true. Most polytomies represent unresolved evolutionary$\backslash$n relationships. In this case a polytomy is called apparent. In this work we modify the problem of reconciling gene and species trees by interpreting polytomies to be apparent, based$\backslash$n on a natural extension of the Gene Duplication model. We further provide polynomial time algorithms to solve this modified$\backslash$n problem.
Research areas:
Year:
2016
Type of Publication:
Article
Journal:
LNCS
Volume:
9797
Pages:
105-118
ISSN:
1432-0541
DOI:
10.1007/s00453-016-0176-1
Hits: 1134

We use cookies to improve our website and your experience when using it. Cookies used for the essential operation of this site have already been set. To find out more about the cookies we use and how to delete them, see our privacy policy.

  I accept cookies from this site.
EU Cookie Directive Module Information