A practical O(n log2n) time algorithm for computing the triplet distance on binary trees

The triplet distance is a distance measure that compares two rooted trees on the same set of leaves by enumerating all sub-sets of three leaves and counting how often the induced topologies of the tree are equal or different. We present an algorithm that computes the triplet distance between two roo...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	BMC bioinformatics Ročník 14; číslo Suppl 2; s. S18
Hlavní autori:	Sand, Andreas, Brodal, Gerth Stølting, Fagerberg, Rolf, Pedersen, Christian NS, Mailund, Thomas
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London BioMed Central 21.01.2013 Springer Nature B.V
Predmet:	Algorithms Bioinformatics Biomedical and Life Sciences Computational Biology - methods Computational Biology/Bioinformatics Computer Appl. in Life Sciences Computer science Computer Simulation Leaves Life Sciences Microarrays Phylogeny Proceedings Software Studies Lower Common Ancestor Brodal Contractible Edge Time Algorithm Binary Tree
ISSN:	1471-2105, 1471-2105
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	The triplet distance is a distance measure that compares two rooted trees on the same set of leaves by enumerating all sub-sets of three leaves and counting how often the induced topologies of the tree are equal or different. We present an algorithm that computes the triplet distance between two rooted binary trees in time O ( n log 2 n ). The algorithm is related to an algorithm for computing the quartet distance between two unrooted binary trees in time O ( n log n ). While the quartet distance algorithm has a very severe overhead in the asymptotic time complexity that makes it impractical compared to O ( n 2 ) time algorithms, we show through experiments that the triplet distance algorithm can be implemented to give a competitive wall-time running time.
AbstractList	The triplet distance is a distance measure that compares two rooted trees on the same set of leaves by enumerating all sub-sets of three leaves and counting how often the induced topologies of the tree are equal or different. We present an algorithm that computes the triplet distance between two rooted binary trees in time O (n log2 n). The algorithm is related to an algorithm for computing the quartet distance between two unrooted binary trees in time O (n log n). While the quartet distance algorithm has a very severe overhead in the asymptotic time complexity that makes it impractical compared to O (n2) time algorithms, we show through experiments that the triplet distance algorithm can be implemented to give a competitive wall-time running time. The triplet distance is a distance measure that compares two rooted trees on the same set of leaves by enumerating all sub-sets of three leaves and counting how often the induced topologies of the tree are equal or different. We present an algorithm that computes the triplet distance between two rooted binary trees in time O (n log2 n). The algorithm is related to an algorithm for computing the quartet distance between two unrooted binary trees in time O (n log n). While the quartet distance algorithm has a very severe overhead in the asymptotic time complexity that makes it impractical compared to O (n2) time algorithms, we show through experiments that the triplet distance algorithm can be implemented to give a competitive wall-time running time.The triplet distance is a distance measure that compares two rooted trees on the same set of leaves by enumerating all sub-sets of three leaves and counting how often the induced topologies of the tree are equal or different. We present an algorithm that computes the triplet distance between two rooted binary trees in time O (n log2 n). The algorithm is related to an algorithm for computing the quartet distance between two unrooted binary trees in time O (n log n). While the quartet distance algorithm has a very severe overhead in the asymptotic time complexity that makes it impractical compared to O (n2) time algorithms, we show through experiments that the triplet distance algorithm can be implemented to give a competitive wall-time running time. The triplet distance is a distance measure that compares two rooted trees on the same set of leaves by enumerating all sub-sets of three leaves and counting how often the induced topologies of the tree are equal or different. We present an algorithm that computes the triplet distance between two rooted binary trees in time O ( n log 2 n ). The algorithm is related to an algorithm for computing the quartet distance between two unrooted binary trees in time O ( n log n ). While the quartet distance algorithm has a very severe overhead in the asymptotic time complexity that makes it impractical compared to O ( n 2 ) time algorithms, we show through experiments that the triplet distance algorithm can be implemented to give a competitive wall-time running time. Doc number: S18 Abstract: The triplet distance is a distance measure that compares two rooted trees on the same set of leaves by enumerating all sub-sets of three leaves and counting how often the induced topologies of the tree are equal or different. We present an algorithm that computes the triplet distance between two rooted binary trees in time O (n log2 n ). The algorithm is related to an algorithm for computing the quartet distance between two unrooted binary trees in time O (n log n ). While the quartet distance algorithm has a very severe overhead in the asymptotic time complexity that makes it impractical compared to O (n2 ) time algorithms, we show through experiments that the triplet distance algorithm can be implemented to give a competitive wall-time running time.
ArticleNumber	S18
Author	Pedersen, Christian NS Brodal, Gerth Stølting Mailund, Thomas Sand, Andreas Fagerberg, Rolf
AuthorAffiliation	4 Department of Mathematics and Computer Science, University of Southern Denmark, Denmark 1 Bioinformatics Research Center, Aarhus University, Denmark 2 Department of Computer Science, Aarhus University, Denmark 3 MADALGO, Center for Massive Data Algorithms, a Center of the Danish National Research Foundation, Denmark 5 PUMPKIN, Center for Membrane Pumps in Cells and Disease, a Center of the Danish National Research Foundation, Denmark
AuthorAffiliation_xml	– name: 1 Bioinformatics Research Center, Aarhus University, Denmark – name: 2 Department of Computer Science, Aarhus University, Denmark – name: 3 MADALGO, Center for Massive Data Algorithms, a Center of the Danish National Research Foundation, Denmark – name: 4 Department of Mathematics and Computer Science, University of Southern Denmark, Denmark – name: 5 PUMPKIN, Center for Membrane Pumps in Cells and Disease, a Center of the Danish National Research Foundation, Denmark
Author_xml	– sequence: 1 givenname: Andreas surname: Sand fullname: Sand, Andreas organization: Bioinformatics Research Center, Aarhus University, Department of Computer Science, Aarhus University – sequence: 2 givenname: Gerth Stølting surname: Brodal fullname: Brodal, Gerth Stølting organization: Department of Computer Science, Aarhus University, MADALGO, Center for Massive Data Algorithms, a Center of the Danish National Research Foundation – sequence: 3 givenname: Rolf surname: Fagerberg fullname: Fagerberg, Rolf organization: Department of Mathematics and Computer Science, University of Southern Denmark – sequence: 4 givenname: Christian NS surname: Pedersen fullname: Pedersen, Christian NS organization: Bioinformatics Research Center, Aarhus University, Department of Computer Science, Aarhus University, PUMPKIN, Center for Membrane Pumps in Cells and Disease, a Center of the Danish National Research Foundation – sequence: 5 givenname: Thomas surname: Mailund fullname: Mailund, Thomas email: mailund@birc.au.dk organization: Bioinformatics Research Center, Aarhus University
BackLink	https://www.ncbi.nlm.nih.gov/pubmed/23368759$$D View this record in MEDLINE/PubMed
BookMark	eNqFkUtr3DAUhUVJaR7tLygUQTfpwq0etiRvCiH0EQhkMS10J2T52qNgS64kF_rvq2HSYZpFutJF9ztX5-qcoxMfPCD0mpL3lCrxgdaSVoySpqJ1tWHVhqpn6Oxwe3JUn6LzlO4JoVKR5gU6ZZwLJZv2DP24wks0NjtrJnx36fEURubf4exmwGYaQ3R5O-MhRGzDvKzZ-RHnLeAc3TJBxr1L2XgLOHjcOW_i79ICSC_R88FMCV49nBfo--dP366_Vrd3X26ur24ry1uuKgZCNJIzQ0VX12SAUsIgiOxZ3zTdoFpJpaCsFjWxHVDVE8OBqb4VtuO84xfo437usnYz9BZ8jmbSS3Rz8aKDcfrfjndbPYZfmjd1qxpaBlw-DIjh5wop69klC9NkPIQ1acqU5Kpmkhf07SP0PqzRl_UKJamggresUG-OHR2s_P30AvA9YGNIKcJwQCjRu2j1Lji9C65UesN0ibao2kcq67LJLuzWctN_tPVem8pLfoR4ZPwJ2R_E5rgY
CitedBy_id	crossref_primary_10_1145_3433651 crossref_primary_10_3390_biology2041189 crossref_primary_10_1093_bioadv_vbaf104
Cites_doi	10.1186/1748-7188-1-16 10.1142/S0219720008003266 10.1142/9781860947995_0013 10.1016/0025-5564(81)90043-2 10.1007/s00453-003-1065-y 10.1093/sysbio/45.3.323 10.1186/1748-7188-6-15 10.1016/j.tcs.2011.08.027 10.1007/BF01908061 10.1093/bioinformatics/bth097 10.2307/2413326
ContentType	Journal Article
Copyright	Sand et al.; licensee BioMed Central Ltd. 2013 This article is published under license to BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License ( ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 2013 Sand et al.; licensee BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Copyright ©2013 Sand et al.; licensee BioMed Central Ltd. 2013 Sand et al.; licensee BioMed Central Ltd.
Copyright_xml	– notice: Sand et al.; licensee BioMed Central Ltd. 2013 This article is published under license to BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License ( ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. – notice: 2013 Sand et al.; licensee BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. – notice: Copyright ©2013 Sand et al.; licensee BioMed Central Ltd. 2013 Sand et al.; licensee BioMed Central Ltd.
DBID	C6C AAYXX CITATION CGR CUY CVF ECM EIF NPM 3V. 7QO 7SC 7X7 7XB 88E 8AL 8AO 8FD 8FE 8FG 8FH 8FI 8FJ 8FK ABUWG AEUYN AFKRA ARAPS AZQEC BBNVY BENPR BGLVJ BHPHI CCPQU DWQXO FR3 FYUFA GHDGH GNUQQ HCIFZ JQ2 K7- K9. L7M LK8 L~C L~D M0N M0S M1P M7P P5Z P62 P64 PHGZM PHGZT PIMPY PJZUB PKEHL PPXIY PQEST PQGLB PQQKQ PQUKI PRINS Q9U 7X8 5PM
DOI	10.1186/1471-2105-14-S2-S18
DatabaseName	Springer Nature OA Free Journals CrossRef Medline MEDLINE MEDLINE (Ovid) MEDLINE MEDLINE PubMed ProQuest Central (Corporate) Biotechnology Research Abstracts Computer and Information Systems Abstracts Health & Medical Collection ProQuest Central (purchase pre-March 2016) Medical Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Natural Science Collection ProQuest Hospital Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) One Sustainability ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials Biological Science Collection ProQuest Central Technology Collection Natural Science Collection ProQuest One ProQuest Central Korea Engineering Research Database Health Research Premium Collection Health Research Premium Collection (Alumni) ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database ProQuest Health & Medical Complete (Alumni) Advanced Technologies Database with Aerospace ProQuest Biological Science Collection Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Health & Medical Collection (Alumni) Medical Database Biological Science Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Biotechnology and BioEngineering Abstracts ProQuest Central Premium ProQuest One Academic (New) Publicly Available Content Database ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) One Health & Nursing ProQuest One Academic Eastern Edition (DO NOT USE) One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China ProQuest Central Basic MEDLINE - Academic PubMed Central (Full Participant titles)
DatabaseTitle	CrossRef MEDLINE Medline Complete MEDLINE with Full Text PubMed MEDLINE (Ovid) Publicly Available Content Database Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest Central China ProQuest One Applied & Life Sciences ProQuest One Sustainability Health Research Premium Collection Natural Science Collection Health & Medical Research Collection Biological Science Collection ProQuest Central (New) ProQuest Medical Library (Alumni) Advanced Technologies & Aerospace Collection ProQuest Biological Science Collection ProQuest One Academic Eastern Edition ProQuest Hospital Collection ProQuest Technology Collection Health Research Premium Collection (Alumni) Biological Science Database ProQuest Hospital Collection (Alumni) Biotechnology and BioEngineering Abstracts ProQuest Health & Medical Complete ProQuest One Academic UKI Edition Engineering Research Database ProQuest One Academic ProQuest One Academic (New) Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest One Health & Nursing ProQuest Natural Science Collection ProQuest Pharma Collection ProQuest Central ProQuest Health & Medical Research Collection Biotechnology Research Abstracts Health and Medicine Complete (Alumni Edition) ProQuest Central Korea Advanced Technologies Database with Aerospace ProQuest Computing ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest Medical Library ProQuest Central (Alumni) MEDLINE - Academic
DatabaseTitleList	MEDLINE - Academic CrossRef Publicly Available Content Database MEDLINE
Database_xml	– sequence: 1 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Biology Computer Science
EISSN	1471-2105
EndPage	S18
ExternalDocumentID	PMC3549851 2870608591 23368759 10_1186_1471_2105_14_S2_S18
Genre	Research Support, Non-U.S. Gov't Journal Article
GroupedDBID	--- 0R~ 23N 2WC 4.4 53G 5VS 6J9 7X7 88E 8AO 8FE 8FG 8FH 8FI 8FJ AAFWJ AAJSJ AAKPC AASML ABDBF ABUWG ACGFO ACGFS ACIHN ACIWK ACPRK ACUHS ADBBV ADMLS ADRAZ ADUKV AEAQA AENEX AEUYN AFKRA AFPKN AFRAH AHBYD AHMBA AHSBF AHYZX ALMA_UNASSIGNED_HOLDINGS AMKLP AMTXH AOIJS ARAPS AZQEC BAPOH BAWUL BBNVY BCNDV BENPR BFQNJ BGLVJ BHPHI BMC BPHCQ BVXVI C6C CCPQU CS3 DIK DU5 DWQXO E3Z EAD EAP EAS EBD EBLON EBS EJD EMB EMK EMOBN ESX F5P FYUFA GNUQQ GROUPED_DOAJ GX1 H13 HCIFZ HMCUK HYE IAO ICD IHR INH INR ISR ITC K6V K7- KQ8 LK8 M1P M48 M7P MK~ ML0 M~E O5R O5S OK1 OVT P2P P62 PGMZT PHGZM PHGZT PIMPY PJZUB PPXIY PQGLB PQQKQ PROAC PSQYO PUEGO RBZ RNS ROL RPM RSV SBL SOJ SV3 TR2 TUS UKHRP W2D WOQ WOW XH6 XSB AAYXX AFFHD CITATION 123 2VQ ALIPV C1A CGR CUY CVF ECM EIF IPNFZ NPM RIG 3V. 7QO 7SC 7XB 8AL 8FD 8FK FR3 JQ2 K9. L7M L~C L~D M0N P64 PKEHL PQEST PQUKI PRINS Q9U 7X8 5PM
ID	FETCH-LOGICAL-c3938-2e665732a16b440fe32aef607d2d55bf897176124640cbe18d0a3e28d96cb33b3
IEDL.DBID	RSV
ISSN	1471-2105
IngestDate	Tue Nov 04 01:45:18 EST 2025 Sun Nov 09 09:09:18 EST 2025 Mon Oct 06 18:25:04 EDT 2025 Mon Jul 21 06:00:42 EDT 2025 Tue Nov 18 21:15:06 EST 2025 Sat Nov 29 05:39:54 EST 2025 Sat Sep 06 07:21:12 EDT 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	Suppl 2
Keywords	Lower Common Ancestor Brodal Contractible Edge Time Algorithm Binary Tree
Language	English
License	This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c3938-2e665732a16b440fe32aef607d2d55bf897176124640cbe18d0a3e28d96cb33b3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23
OpenAccessLink	https://link.springer.com/10.1186/1471-2105-14-S2-S18
PMID	23368759
PQID	1271616392
PQPubID	44065
ParticipantIDs	pubmedcentral_primary_oai_pubmedcentral_nih_gov_3549851 proquest_miscellaneous_1287384273 proquest_journals_1271616392 pubmed_primary_23368759 crossref_primary_10_1186_1471_2105_14_S2_S18 crossref_citationtrail_10_1186_1471_2105_14_S2_S18 springer_journals_10_1186_1471_2105_14_S2_S18
PublicationCentury	2000
PublicationDate	20130121
PublicationDateYYYYMMDD	2013-01-21
PublicationDate_xml	– month: 1 year: 2013 text: 20130121 day: 21
PublicationDecade	2010
PublicationPlace	London
PublicationPlace_xml	– name: London – name: England
PublicationTitle	BMC bioinformatics
PublicationTitleAbbrev	BMC Bioinformatics
PublicationTitleAlternate	BMC Bioinformatics
PublicationYear	2013
Publisher	BioMed Central Springer Nature B.V
Publisher_xml	– name: BioMed Central – name: Springer Nature B.V
References	T Mailund (5607_CR10) 2004; 20 MS Stissing (5607_CR11) 2008; 6 WHE Day (5607_CR4) 1985; 2 DF Robinson (5607_CR1) 1981; 53 GS Brodal (5607_CR13) 2001 J Nielsen (5607_CR7) 2011; 6 MS Stissing (5607_CR6) 2007 MS Bansal (5607_CR9) 2011; 412 D Bryant (5607_CR12) 2000 DE Critchlow (5607_CR2) 1996; 45 GS Brodal (5607_CR5) 2004; 38 GF Estabrook (5607_CR3) 1985; 34 C Christiansen (5607_CR8) 2006; 1 16999860 - Algorithms Mol Biol. 2006 Sep 25;1:16 14962942 - Bioinformatics. 2004 Jul 10;20(10):1636-7 21639882 - Algorithms Mol Biol. 2011 Jun 03;6:15 18324744 - J Bioinform Comput Biol. 2008 Feb;6(1):37-50
References_xml	– volume: 1 start-page: 16 year: 2006 ident: 5607_CR8 publication-title: Algorithms Mol Biol doi: 10.1186/1748-7188-1-16 – volume: 6 start-page: 37 year: 2008 ident: 5607_CR11 publication-title: Journal of Bioinformatics and Computational Biology doi: 10.1142/S0219720008003266 – start-page: 101 volume-title: Proceedings of the 5th Asia-Pacific Bioinformatics Conference (APBC) year: 2007 ident: 5607_CR6 doi: 10.1142/9781860947995_0013 – volume: 53 start-page: 131 year: 1981 ident: 5607_CR1 publication-title: Mathematical Biosciences doi: 10.1016/0025-5564(81)90043-2 – volume: 38 start-page: 377 issue: 2 year: 2004 ident: 5607_CR5 publication-title: Algorithmica doi: 10.1007/s00453-003-1065-y – volume: 45 start-page: 323 issue: 3 year: 1996 ident: 5607_CR2 publication-title: Systematic Biology doi: 10.1093/sysbio/45.3.323 – volume: 6 start-page: 15 year: 2011 ident: 5607_CR7 publication-title: Algorithms for Molecular Biology doi: 10.1186/1748-7188-6-15 – volume: 412 start-page: 6634 issue: 48 year: 2011 ident: 5607_CR9 publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2011.08.027 – start-page: 285 volume-title: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms year: 2000 ident: 5607_CR12 – volume: 2 start-page: 7 year: 1985 ident: 5607_CR4 publication-title: Journal of Classification doi: 10.1007/BF01908061 – volume: 20 start-page: 1636 issue: 10 year: 2004 ident: 5607_CR10 publication-title: Bioinformatics doi: 10.1093/bioinformatics/bth097 – volume: 34 start-page: 193 issue: 2 year: 1985 ident: 5607_CR3 publication-title: Systematic Zoology doi: 10.2307/2413326 – start-page: 731 volume-title: Proceedings of the 12th International Symposium on Algorithms and Computation (ISAAC) year: 2001 ident: 5607_CR13 – reference: 14962942 - Bioinformatics. 2004 Jul 10;20(10):1636-7 – reference: 21639882 - Algorithms Mol Biol. 2011 Jun 03;6:15 – reference: 16999860 - Algorithms Mol Biol. 2006 Sep 25;1:16 – reference: 18324744 - J Bioinform Comput Biol. 2008 Feb;6(1):37-50
SSID	ssj0017805
Score	2.107731
Snippet	The triplet distance is a distance measure that compares two rooted trees on the same set of leaves by enumerating all sub-sets of three leaves and counting... Doc number: S18 Abstract: The triplet distance is a distance measure that compares two rooted trees on the same set of leaves by enumerating all sub-sets of...
SourceID	pubmedcentral proquest pubmed crossref springer
SourceType	Open Access Repository Aggregation Database Index Database Enrichment Source Publisher
StartPage	S18
SubjectTerms	Algorithms Bioinformatics Biomedical and Life Sciences Computational Biology - methods Computational Biology/Bioinformatics Computer Appl. in Life Sciences Computer science Computer Simulation Leaves Life Sciences Microarrays Phylogeny Proceedings Software Studies
SummonAdditionalLinks	– databaseName: Biological Science Database dbid: M7P link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NaxUxEB-0KnixWj-6WiWCBwVDd_O1yUlKafEgtfBUCh6W3WxeW6j72ve2Qv_7zuRl19ZiL16WQJJNwkyS32SS-QG8s8LL2oacN0pbrqbGcOu1wpStrdNNEyLH0o8v5d6ePThw--nAbZGuVQ5rYlyo25mnM_LNQiCyR_DgxKfTM06sUeRdTRQad-EeRUkQ8ere_uhFoHj9KdJQYc1mgQsxRxNH80LxieATYvq4uhvdgJg3b0r-5S6Nu9Du6v_2_zE8SviTbS0V5gncCd0aPFgyUl6swerA8sDSpH8KP7dYekqF9b6y9x0jNlnWsQ-MiOlZfXKI7fRHvxjiX-Zjfew7Q2TJ-jmd4_esJZSKf2OzjjXxBTAjb_jiGXzf3fm2_ZknSgbupcOlUQTy1EhRF6ZRKp8GTIapyctWtFo3U-vQPETQpIzKPcrZtnktg7CtM76RspHPYaWbdWEdmMWCyuTSaVsoXdb4daZoTIvKo9uizUAMoql8ildOtBknVbRbrKlInhXJE1PVRFQozww-jpVOl-E6bi--MQirSnN3Uf2RVAZvx2ycdeRKqbswO6cytpRWIfbL4MVSRcb2hJQGrUCXQXlNecYCFNH7ek53fBQje0u01hECZ8AHNbvSrX8P4-Xtw3gFD0Uk8SDt34CVfn4eXsN9_7s_XszfxClzCT2IGxE priority: 102 providerName: ProQuest
Title	A practical O(n log2n) time algorithm for computing the triplet distance on binary trees
URI	https://link.springer.com/article/10.1186/1471-2105-14-S2-S18 https://www.ncbi.nlm.nih.gov/pubmed/23368759 https://www.proquest.com/docview/1271616392 https://www.proquest.com/docview/1287384273 https://pubmed.ncbi.nlm.nih.gov/PMC3549851
Volume	14
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVADU databaseName: BioMed Central Open Access Free customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: RBZ dateStart: 20000101 isFulltext: true titleUrlDefault: https://www.biomedcentral.com/search/ providerName: BioMedCentral – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: DOA dateStart: 20000101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: M~E dateStart: 20000101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: P5Z dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Biological Science Database customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: M7P dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com/biologicalscijournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: K7- dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Health & Medical Collection customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: 7X7 dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: BENPR dateStart: 20090101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: PIMPY dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: RSV dateStart: 20001201 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwEB71ARIXypvQEhmJA0hYTfzK5FhQKxCwRF2oFi5RHl66Usmi3RSJf8_Ym0TdVkWCi2XJYzmxx_Y3Hns-gOcoKlmgjXipNHI1NYZjpRXlsMBUl6X1HEsnH5LRCCeTNNsA3b-F8bfde5ekX6n9tEazH9MyyslA0TxWfCz4OMZN2Kb9Dh1jw_H4ZHAeuDD9XYChayqub0JXkOXVC5KXvKR-8zna-c_PvgO3O7TJDlbqcRc2bHMPbq74J3_fh8kB615JkdCnFw1zPLHNS-YI51lx9n2-mLWnPxjhWlZ59gdqmBFiZO3Cnc-3rHbok9SGzRtW-pe9zHm5lw_gy9Hh5zdveUe1wCuZ0pInrPPASFHEplQqmlrK2qmJklrUWpdTTMnsIzCkjIoqGj-so0JagXVqqlLKUj6ErWbe2MfAkASViWSqMVY6KShNTVyampRC13EdgOj7Pq-6OOSODuMs9_YImtx1We66jHL5WOTUZQG8Gir9XIXh-Lv4Xj-oeTcnl3ksyDYk-JmKAJ4NxTSbnIukaOz83MlgIlERpgvg0UoHhvaElIasuzSAZE07BgEXqXu9pJmd-ojdkqxwgrYB8F5HLnzW9b_x5B_ld-GW8GwdTuP2YKtdnNuncKP61c6WixA2k0niUwxh-_XhKDsO_REEpe8THrprrxmlmf5G5dm7j9nX0E-sP-SOFAY
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VAoILhUIhUGCQQAIJq4lfsQ8IVUDVapcFaUtViUOah5eu1GbLbgrqn-I3Ms5jaanorQcukaXYSZz9ZvzNTjwfwHPDc5EaF7JMKsPkSGtmciWpZVJjVZa5WmNppx8PBmZ3135egF_dXhj_WWXnE2tHXUxy_x_5WsSJ2RN5sPzt0XfmVaN8drWT0Ghg0XMnPylkm73Zek-_7wvONz5sv9tkraoAy4Ul6-bOJxsETyOdSRmOHDXdSIdxwQulspGxFOHQui-1DHN6VFOEqXDcFFbnmRCZoOtegatSmNjbVS9m86yF1wdoKxtFRq9F5PgZhVSKRZINORt6ZZHTq985Snv-y8y_0rP1qrex9L-9r9twq-XXuN4YxB1YcOUyXG8UN0-WYalTscDWqd2Fr-vYbhWjcZ_wZYleLRdLfIXV-NBhevCN5lXtHyLxe8zr8fSukJgzVlOfp6iw8CycroaTErN6hzP6bP_sHny5lMmuwGI5Kd0DQEMdpQ6FVSaSKk7paHWU6YKMQxVREQDvoJDkbT12LwtykNRxmdGJx0_i8UOtZMgTwk8Ar-eDjppyJBd3X-3AkbS-aZb8QUYAz-anyav4VFFausmx70PoNpK4bQD3G0jO78eF0BTl2gDiM2Cdd_AVy8-eKcf7deVyoaQlih8A62B96rH-PY2HF0_jKdzY3P7YT_pbg94juMlrwRJveauwWE2P3WO4lv-oxrPpk9pcEfYuG--_AfI8dYg
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3daxQxEB-0fuCL39W1VSP4oGDobr42-1jUQ7GchdNyb2GzybYHNVfutoL_vZP9omepIPiyBDJhN8kk-c3OZH4ArzWreKl9Sq2QmopaKaorKbCkS11Ia33LsXR0kE-nej4vDvtowvUQ7T64JLs7DTFLU2j2zlzdLXGt9jLcUikaK5Jmgs4YnWX6OtwQMZI-Guyzo9GREFP298mGrmi4eSBdQpmXgyX_8Ji2B9Hk3n_own2426NQst-pzQO45sNDuNXxUv56BPN90t-eQqGvbwKJ_LHhLYlE9KQ8PV6uFs3JD4J4l1QtKwR-BEEkSZpV_G_fEBdRKaoTWQZi2xu_JHq_14_h--Tjt_efaE_BQCte4FbIfPTMcFZmygqR1h6LvlZp7piT0ta6QHMQQZJQIq1wXrVLS-6ZdoWqLOeWb8NWWAb_FIhGQaFSXkidCZmX-CxUZpVDZZEucwmwYR5M1ecnjzQZp6a1U7QycchMHDIsmRkzOGQJvBsbnXXpOf4uvjtMsOnX6tpkDG1GhKUFS-DVWI2rLLpOyuCX51FG51wLxHoJPOn0YXwf41yh1VckkG9oyigQM3hv1oTFSZvJm6N1jpA3ATroy4XPurobz_5R_iXcPvwwMQefp1924A5rCT2i8u3CVrM698_hZvWzWaxXL9q18xuflxb5
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+practical+O%28n+log2n%29+time+algorithm+for+computing+the+triplet+distance+on+binary+trees&rft.jtitle=BMC+bioinformatics&rft.au=Sand%2C+Andreas&rft.au=Brodal%2C+Gerth+St%C3%B8lting&rft.au=Fagerberg%2C+Rolf&rft.au=Pedersen%2C+Christian+NS&rft.date=2013-01-21&rft.pub=BioMed+Central&rft.eissn=1471-2105&rft.volume=14&rft.issue=Suppl+2&rft_id=info:doi/10.1186%2F1471-2105-14-S2-S18&rft.externalDocID=10_1186_1471_2105_14_S2_S18
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-2105&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-2105&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-2105&client=summon