Fast NJ-like algorithms to deal with incomplete distance matrices (Q33325788)

https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:18366787%20AND%20SRC:MED&resulttype=core&format=json

4 January 2020

title

Fast NJ-like algorithms to deal with incomplete distance matrices (English)

1 reference

https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:18366787%20AND%20SRC:MED&resulttype=core&format=json

4 January 2020

0 references

1

1 reference

https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:18366787%20AND%20SRC:MED&resulttype=core&format=json

4 January 2020

author name string

Olivier Gascuel

series ordinal

2

1 reference

https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:18366787%20AND%20SRC:MED&resulttype=core&format=json

4 January 2020

publication date

26 March 2008

1 reference

https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:18366787%20AND%20SRC:MED&resulttype=core&format=json

4 January 2020

1 reference

https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:18366787%20AND%20SRC:MED&resulttype=core&format=json

4 January 2020

volume

9

1 reference

https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:18366787%20AND%20SRC:MED&resulttype=core&format=json

4 January 2020

page(s)

166

1 reference

https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:18366787%20AND%20SRC:MED&resulttype=core&format=json

Creative Commons Attribution 2.0 Generic

4 January 2020

copyright license

start time

26 March 2008

1 reference

April 2022 Public Data File from Crossref

copyright status

copyrighted

1 reference

April 2022 Public Data File from Crossref

exact match

https://scigraph.springernature.com/pub.10.1186/1471-2105-9-166

0 references

cites work

A model of horizontal gene transfer and the bacterial phylogeny problem

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

A higher-level MRP supertree of placental mammals

21 June 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

Neighbor-joining revealed.

21 June 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

Shortest triplet clustering: reconstructing large phylogenies using representative sets

21 June 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

Prospects for building the tree of life from large sequence databases

21 June 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

Phylogenomics of eukaryotes: impact of missing data on large alignments

21 June 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood

21 June 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle

21 June 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

T-REX: reconstructing and visualizing phylogenetic trees and reticulation networks

21 June 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

The optimization principle in phylogenetic analysis tends to give incorrect topologies when the number of nucleotides or amino acids used is small

21 June 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data

21 June 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

Neighbor-joining uses the optimal weight for net divergence

21 June 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates

21 June 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

The neighbor-joining method: a new method for reconstructing phylogenetic trees

21 June 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

A note on the neighbor-joining algorithm of Saitou and Nei.

21 June 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

The statistical sign test.

21 June 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

Maximum likelihood supertrees.

31 October 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

Phylogenetic supermatrix analysis of GenBank sequences from 2228 papilionoid legumes

31 October 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

SDM: a fast distance-based approach for (super) tree building in phylogenomics

31 October 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

Relaxed neighbor joining: a fast distance-based phylogenetic tree construction method.

31 October 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

Weighted least-squares likelihood ratio test for branch testing in phylogenies reconstructed from distance measures.

31 October 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

Performance of flip supertree construction with a heuristic algorithm.

31 October 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

QuickJoin--fast neighbour-joining tree reconstruction.

31 October 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

QuickTree: building huge Neighbour-Joining trees of protein sequences.

31 October 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

An efficient and accurate distance based algorithm to reconstruct tandem duplication trees.

31 October 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

An alternating least squares approach to inferring phylogenies from pairwise distances.

31 October 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

Efficiencies of fast algorithms of phylogenetic inference under the criteria of maximum parsimony, minimum evolution, and maximum likelihood when a large number of sequences are used.

31 October 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

Weighted neighbor joining: a likelihood-based approach to distance-based phylogeny reconstruction

31 October 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

A note on Sattath and Tversky's, Saitou and Nei's, and Studier and Keppler's algorithms for inferring phylogenies from evolutionary distances.

31 October 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=2335114

Efficiency of the neighbor-joining method in reconstructing deep and shallow evolutionary relationships in large phylogenies

31 October 2018

1 reference

12 December 2020

Traditional phylogenetic reconstruction methods reconstruct shallow and deep evolutionary relationships equally well

1 reference

12 December 2020

Properties of matrix representation with parsimony analyses

1 reference

12 December 2020

Resolution of a supertree/supermatrix paradox

1 reference

12 December 2020

Phylogenetic inference based on matrix representation of trees

1 reference

12 December 2020

A weighted least-squares approach for inferring phylogenies from incomplete distance matrices

1 reference

12 December 2020

Reconstructing an ultrametric galled phylogenetic network from a distance matrix.

1 reference

12 December 2020

Relative efficiencies of the maximum parsimony and distance-matrix methods in obtaining the correct phylogenetic tree

1 reference

12 December 2020

Identifiers

DOI

10.1186/1471-2105-9-166

1 reference

https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:18366787%20AND%20SRC:MED&resulttype=core&format=json

journals/bmcbi/CriscuoloG08

4 January 2020

DBLP publication ID

1 reference

DBLP Dataset 2021-01-02

Dimensions Publication ID

28 January 2021

0 references

1 reference

https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:18366787%20AND%20SRC:MED&resulttype=core&format=json

4 January 2020

1 reference