Treewidth-based algorithms for the small parsimony problem on networks

HIGHLIGHTS

• who: Celine Scornavacca from the (UNIVERSITY) have published the research: Treewidth-based algorithms for the small parsimony problem on networks, in the Journal: (JOURNAL)
• what: The authors show for all vertices w on a u-vG,u03c3 path p in u0174 u03c3 that w u2264u03c3 u and u w. The authors show that u0174 u2032 agrees with G. To this end, let xy u2208 E(G) and let x and y be unrelated in u0174 u2032. The authors show that u2264u0174u2032 is a strict subset of u2264u0174. To prove the lemma, the authors show YWu0174x . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or E-mail:

  If you don't have an account, you can create one here.