Efficient computation of template matrices

MaRDI QIDQ3625837zbMATH OpenFDO

Authors Gabriel Valiente, Tetsuo Asano, Francesc Rosselló

Publication date 22 May 2009

Full work available at URL http://bioinfo.uib.es/~cesc/recerca/publicacions/jmda-template.pdf

zbMATH Keywords

Boolean matrix multiplicationconflict graphgenotypehaplotypeperfect phylogenyphylogenetic network with recombinationsite consistencytemplate matrix

Mathematics Subject Classification ID

Problems related to evolution (92D15)

Recommendations

• A linear-time algorithm for the perfect phylogeny haplotype problem
• A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
• Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems
• Research in Computational Molecular Biology
• Publication:4886095

Cited in

(2)

• An algorithm for construction of all perfect phylogeny matrices
• FMMTL: FMM Template Library A Generalized Framework for Kernel Matrices

This page was built for publication: Efficient computation of template matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3625837)