10.1007/978-3-642-15775-2_49Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)6346 LNCSPART 1573-58
Consensus tree built by the neighbour-joining method using the NKY model of GENEIOUS Pro (V.6.1.5) w...
The resulting 50% majority rule consensus trees (with and without branch length data) from the analy...
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...
10.1007/978-3-642-25591-5_76Lecture Notes in Computer Science (including subseries Lecture Notes in ...
10.1007/978-3-642-40453-5_12Lecture Notes in Computer Science (including subseries Lecture Notes in ...
10.1007/978-3-642-37195-0_8Lecture Notes in Computer Science (including subseries Lecture Notes in A...
Department of computer science, Université du Québec à Montréal, Montréal, Canad
Department of computer science, Université du Québec à Montréal, Montréal, Canad
This is the consensus tree from the BEAST analysis of the concatenated sequence data from RAG1 and R...
This is the consensus tree from the BEAST analysis of the concatenated sequence data from RAG1 and R...
Department of computer science, Université du Québec à Montréal, Case postale 8888, Succursale Centr...
Abstract. This paper presents two new deterministic algorithms for constructing consensus trees. Giv...
In this paper we consider two challenging problems that arise in the context of computing a consensu...
International audienceThe maximum agreement subtree method determines the consensus of a collection ...
A consensus tree is a single phylogenetic tree that summarizes the branching structure in a given se...
Consensus tree built by the neighbour-joining method using the NKY model of GENEIOUS Pro (V.6.1.5) w...
The resulting 50% majority rule consensus trees (with and without branch length data) from the analy...
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...
10.1007/978-3-642-25591-5_76Lecture Notes in Computer Science (including subseries Lecture Notes in ...
10.1007/978-3-642-40453-5_12Lecture Notes in Computer Science (including subseries Lecture Notes in ...
10.1007/978-3-642-37195-0_8Lecture Notes in Computer Science (including subseries Lecture Notes in A...
Department of computer science, Université du Québec à Montréal, Montréal, Canad
Department of computer science, Université du Québec à Montréal, Montréal, Canad
This is the consensus tree from the BEAST analysis of the concatenated sequence data from RAG1 and R...
This is the consensus tree from the BEAST analysis of the concatenated sequence data from RAG1 and R...
Department of computer science, Université du Québec à Montréal, Case postale 8888, Succursale Centr...
Abstract. This paper presents two new deterministic algorithms for constructing consensus trees. Giv...
In this paper we consider two challenging problems that arise in the context of computing a consensu...
International audienceThe maximum agreement subtree method determines the consensus of a collection ...
A consensus tree is a single phylogenetic tree that summarizes the branching structure in a given se...
Consensus tree built by the neighbour-joining method using the NKY model of GENEIOUS Pro (V.6.1.5) w...
The resulting 50% majority rule consensus trees (with and without branch length data) from the analy...
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...
DOI
Add to ORKG