Fast error-tolerant quartet phylogeny algorithms
We present a quartet-based phylogeny algorithm that returns the correct topology for n taxa in O(nlogn) time with high probability, assuming that each quartet is inconsistent with the true tree topology with constant probability, independent of other quartets. Our incremental algorithm relies upon a...
Gespeichert in:
| Veröffentlicht in: | Theoretical computer science Jg. 483; S. 104 - 114 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
29.04.2013
|
| ISSN: | 0304-3975, 1879-2294 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We present a quartet-based phylogeny algorithm that returns the correct topology for n taxa in O(nlogn) time with high probability, assuming that each quartet is inconsistent with the true tree topology with constant probability, independent of other quartets. Our incremental algorithm relies upon a search tree structure for the phylogeny that is balanced, with high probability, no matter the true topology. In experiments, our prototype was as fast as the fastest heuristics, but because real data do not typically satisfy our probabilistic assumptions, its overall performance is not as good as our theoretical results predict. |
|---|---|
| AbstractList | We present a quartet-based phylogeny algorithm that returns the correct topology for n taxa in O(nlogn) time with high probability, assuming that each quartet is inconsistent with the true tree topology with constant probability, independent of other quartets. Our incremental algorithm relies upon a search tree structure for the phylogeny that is balanced, with high probability, no matter the true topology. In experiments, our prototype was as fast as the fastest heuristics, but because real data do not typically satisfy our probabilistic assumptions, its overall performance is not as good as our theoretical results predict. |
| Author | Brown, Daniel G. Truszkowski, Jakub |
| Author_xml | – sequence: 1 givenname: Daniel G. surname: Brown fullname: Brown, Daniel G. email: browndg@uwaterloo.ca – sequence: 2 givenname: Jakub surname: Truszkowski fullname: Truszkowski, Jakub email: jmtruszk@uwaterloo.ca |
| BookMark | eNp9j8FKAzEQQINUsFY_wNv-wK6ZZJtk8STFqlDwoucQk9k2ZbupSRT696bUk4cODwYG3sC7JpMxjEjIHdAGKIj7bZNtahgF1tACiAsyBSW7mrGunZAp5bSteSfnV-Q6pS0tM5diSujSpFxhjCHWOQwYzZirr28TM-ZqvzkMYY3joTLDOkSfN7t0Qy57MyS8_dsz8rF8el-81Ku359fF46q2vKW5ho66grLAlEBpFLfKiDkqi4qXA4MehHVKMjQ9gjNgO8e7Twt93zrp-IzI018bQ0oRe219NtmHMUfjBw1UH8P1VpdwfQzXtACimPDP3Ee_M_Fw1nk4OViSfjxGnazH0aLzEW3WLvgz9i-vSXQf |
| CitedBy_id | crossref_primary_10_1155_2014_642089 |
| Cites_doi | 10.1145/5925.5930 10.1109/SFCS.1998.743492 10.1109/TCBB.2007.1008 10.1016/S0304-3975(99)00028-6 10.1007/3-540-48481-7_28 10.1093/oxfordjournals.molbev.a025664 10.1007/3-540-49116-3_17 10.1089/cmb.2007.0103 10.1007/11780441_5 10.1007/s00453-003-1065-y 10.1093/oxfordjournals.molbev.a003881 10.1007/978-3-642-02008-7_32 10.1007/978-3-642-23038-7_2 10.1145/100216.100230 10.1006/jagm.1996.0035 10.1093/molbev/msp077 10.1089/10665270252935467 10.1007/978-3-642-21458-5_14 |
| ContentType | Journal Article |
| Copyright | 2012 Elsevier B.V. |
| Copyright_xml | – notice: 2012 Elsevier B.V. |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.tcs.2012.02.016 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| EndPage | 114 |
| ExternalDocumentID | 10_1016_j_tcs_2012_02_016 S0304397512001570 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 6I. 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABVKL ABXDB ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW SSZ T5K TN5 WH7 YNT ZMT ~G- 29Q 9DU AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ACLOT ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FGOYB G-2 HZ~ R2- SEW TAE WUQ ZY4 ~HD |
| ID | FETCH-LOGICAL-c340t-190d90d8c1286e7a83c8a65e8ce836e721f16cd872eafe1da1c9d39bc1ff4d7d3 |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000318890000011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Sat Nov 29 05:15:09 EST 2025 Tue Nov 18 22:41:13 EST 2025 Fri Feb 23 02:30:24 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c340t-190d90d8c1286e7a83c8a65e8ce836e721f16cd872eafe1da1c9d39bc1ff4d7d3 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.tcs.2012.02.016 |
| PageCount | 11 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_tcs_2012_02_016 crossref_primary_10_1016_j_tcs_2012_02_016 elsevier_sciencedirect_doi_10_1016_j_tcs_2012_02_016 |
| PublicationCentury | 2000 |
| PublicationDate | 2013-04-29 |
| PublicationDateYYYYMMDD | 2013-04-29 |
| PublicationDate_xml | – month: 04 year: 2013 text: 2013-04-29 day: 29 |
| PublicationDecade | 2010 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2013 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Wu, Kao, Lin, You (br000120) 2008; 3 Snir, Warnow, Rao (br000110) 2008; 15 C. Daskalakis, E. Mossel, S. Roch, Phylogenies without branch bounds: Contracting the short, pruning the deep, in: Proceedings of RECOMB 2009, pp. 451–465. Strimmer, von Haeseler (br000115) 1996; 13 phylogeny algorithm, in: Proceedings of WABI 2011, 2011, pp. 14–25. Price, Dehal, Arkin (br000100) 2009; 26 Wu, You, Lin (br000125) 2007; 4 D. Bryant, J. Tsang, P.E. Kearney, M. Li, Computing the quartet distance between evolutionary trees, in: Proceedings of SODA 2000, pp. 285–286. Csűrös (br000030) 2002; 9 Dubhashi, Panconesi (br000045) 2009 J. Fischer, V. Heun, Theoretical and practical improvements on the rmq-problem, with applications to lca and lce, in: Proceedings of CPM 2006, pp. 36–48. V. King, L. Zhang, Y. Zhou, On the complexity of distance-based evolutionary tree reconstruction, in: Proceedings of SODA 2003, pp. 444–453. Kannan, Lawler, Warnow (br000075) 1996; 21 R.M. Karp, R. Kleinberg, Noisy binary search and its applications, in: Proceedings of SODA 2007, pp. 881–890. Brodal, Fagerberg, Pedersen (br000010) 2003; 38 V. Berry, T. Jiang, P. Kearney, M. Li, T. Wareham, Quartet cleaning: improved algorithms and simulations, In: Proceedings of ESA 1999. pp. 313–324. Erdös, Steel, Székely, Warnow (br000050) 1999; 221 D.G. Brown, J. Truszkowski, Towards a practical Motwani, Raghavan (br000095) 1995 D.G. Brown, J. Truszkowski, Fast error-tolerant quartet phylogeny algorithms, in: Proceedings of CPM 2011, 2011, pp. 147–161. T. Jiang, P. Kearney, M. Li, Orchestrating quartets: approximation and data correction, in: Proceedings of FOCS 1998, pp. 416–425. I. Gronau, S. Moran, S. Snir, Fast and reliable reconstruction of phylogenetic trees with very short edges, in: Proceedings of SODA 2008, pp. 379–388. U. Feige, D. Peleg, P. Raghavan, E. Upfal, Computing with unreliable information, in: Proceedings of STOC 1990, pp. 128–137. Ranwez, Gascuel (br000105) 2001; 18 M.Y. Kao, A. Lingas, A. Östlin, Balanced randomized tree splitting with applications to evolutionary tree constructions, in: Proceedings of STACS 1999, pp. 184–196. Devroye (br000040) 1986; 33 Wu (10.1016/j.tcs.2012.02.016_br000120) 2008; 3 Strimmer (10.1016/j.tcs.2012.02.016_br000115) 1996; 13 10.1016/j.tcs.2012.02.016_br000020 Kannan (10.1016/j.tcs.2012.02.016_br000075) 1996; 21 10.1016/j.tcs.2012.02.016_br000085 Ranwez (10.1016/j.tcs.2012.02.016_br000105) 2001; 18 10.1016/j.tcs.2012.02.016_br000080 10.1016/j.tcs.2012.02.016_br000060 Erdös (10.1016/j.tcs.2012.02.016_br000050) 1999; 221 10.1016/j.tcs.2012.02.016_br000015 Csűrös (10.1016/j.tcs.2012.02.016_br000030) 2002; 9 10.1016/j.tcs.2012.02.016_br000055 10.1016/j.tcs.2012.02.016_br000035 Devroye (10.1016/j.tcs.2012.02.016_br000040) 1986; 33 Snir (10.1016/j.tcs.2012.02.016_br000110) 2008; 15 Brodal (10.1016/j.tcs.2012.02.016_br000010) 2003; 38 Price (10.1016/j.tcs.2012.02.016_br000100) 2009; 26 10.1016/j.tcs.2012.02.016_br000090 10.1016/j.tcs.2012.02.016_br000070 Wu (10.1016/j.tcs.2012.02.016_br000125) 2007; 4 10.1016/j.tcs.2012.02.016_br000025 10.1016/j.tcs.2012.02.016_br000005 10.1016/j.tcs.2012.02.016_br000065 Motwani (10.1016/j.tcs.2012.02.016_br000095) 1995 Dubhashi (10.1016/j.tcs.2012.02.016_br000045) 2009 |
| References_xml | – reference: D. Bryant, J. Tsang, P.E. Kearney, M. Li, Computing the quartet distance between evolutionary trees, in: Proceedings of SODA 2000, pp. 285–286. – volume: 13 start-page: 964 year: 1996 end-page: 969 ident: br000115 article-title: Quartet puzzling: a quartet maximum-likelihood method for reconstructing tree topologies publication-title: Mol. Biol. Evol. – reference: C. Daskalakis, E. Mossel, S. Roch, Phylogenies without branch bounds: Contracting the short, pruning the deep, in: Proceedings of RECOMB 2009, pp. 451–465. – volume: 4 start-page: 139 year: 2007 end-page: 152 ident: br000125 article-title: Quartet-based phylogeny reconstruction with answer set programming publication-title: IEEE/ACM Trans. Comput. Biol. Bioinf. – volume: 38 start-page: 377 year: 2003 end-page: 395 ident: br000010 article-title: Computing the quartet distance between evolutionary trees in time publication-title: Algorithmica – volume: 33 start-page: 489 year: 1986 end-page: 498 ident: br000040 article-title: A note on the height of binary search trees publication-title: J. ACM – reference: T. Jiang, P. Kearney, M. Li, Orchestrating quartets: approximation and data correction, in: Proceedings of FOCS 1998, pp. 416–425. – reference: J. Fischer, V. Heun, Theoretical and practical improvements on the rmq-problem, with applications to lca and lce, in: Proceedings of CPM 2006, pp. 36–48. – volume: 3 year: 2008 ident: br000120 article-title: Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability publication-title: Alg. Mol. Biol. – reference: U. Feige, D. Peleg, P. Raghavan, E. Upfal, Computing with unreliable information, in: Proceedings of STOC 1990, pp. 128–137. – reference: R.M. Karp, R. Kleinberg, Noisy binary search and its applications, in: Proceedings of SODA 2007, pp. 881–890. – year: 1995 ident: br000095 article-title: Randomized Algorithms – reference: D.G. Brown, J. Truszkowski, Towards a practical – year: 2009 ident: br000045 article-title: Concentration of Measure for the Analysis of Randomized Algorithms – reference: V. Berry, T. Jiang, P. Kearney, M. Li, T. Wareham, Quartet cleaning: improved algorithms and simulations, In: Proceedings of ESA 1999. pp. 313–324. – volume: 9 start-page: 277 year: 2002 end-page: 297 ident: br000030 article-title: Fast recovery of evolutionary trees with thousands of nodes publication-title: J. Comp. Biol. – volume: 221 start-page: 77 year: 1999 end-page: 118 ident: br000050 article-title: A few logs suffice to build (almost) all trees: Part II publication-title: Theoret. Comput. Sci – volume: 21 start-page: 26 year: 1996 end-page: 50 ident: br000075 article-title: Determining the evolutionary tree using experiments publication-title: J. Algorithms – volume: 18 start-page: 1103 year: 2001 end-page: 1116 ident: br000105 article-title: Quartet-based phylogenetic inference: improvements and limits publication-title: Mol. Biol. Evol. – volume: 26 start-page: 1641 year: 2009 end-page: 1650 ident: br000100 article-title: FastTree: computing large minimum evolution trees with profiles instead of a distance matrix publication-title: Mol. Biol. Evol. – reference: phylogeny algorithm, in: Proceedings of WABI 2011, 2011, pp. 14–25. – reference: D.G. Brown, J. Truszkowski, Fast error-tolerant quartet phylogeny algorithms, in: Proceedings of CPM 2011, 2011, pp. 147–161. – reference: M.Y. Kao, A. Lingas, A. Östlin, Balanced randomized tree splitting with applications to evolutionary tree constructions, in: Proceedings of STACS 1999, pp. 184–196. – reference: V. King, L. Zhang, Y. Zhou, On the complexity of distance-based evolutionary tree reconstruction, in: Proceedings of SODA 2003, pp. 444–453. – volume: 15 start-page: 91 year: 2008 end-page: 103 ident: br000110 article-title: Short quartet puzzling: a new quartet-based phylogeny reconstruction algorithm publication-title: J. Comp. Biol. – reference: I. Gronau, S. Moran, S. Snir, Fast and reliable reconstruction of phylogenetic trees with very short edges, in: Proceedings of SODA 2008, pp. 379–388. – volume: 33 start-page: 489 issue: 3 year: 1986 ident: 10.1016/j.tcs.2012.02.016_br000040 article-title: A note on the height of binary search trees publication-title: J. ACM doi: 10.1145/5925.5930 – ident: 10.1016/j.tcs.2012.02.016_br000070 doi: 10.1109/SFCS.1998.743492 – volume: 4 start-page: 139 issue: 1 year: 2007 ident: 10.1016/j.tcs.2012.02.016_br000125 article-title: Quartet-based phylogeny reconstruction with answer set programming publication-title: IEEE/ACM Trans. Comput. Biol. Bioinf. doi: 10.1109/TCBB.2007.1008 – ident: 10.1016/j.tcs.2012.02.016_br000085 – volume: 221 start-page: 77 issue: 1–2 year: 1999 ident: 10.1016/j.tcs.2012.02.016_br000050 article-title: A few logs suffice to build (almost) all trees: Part II publication-title: Theoret. Comput. Sci doi: 10.1016/S0304-3975(99)00028-6 – volume: 3 year: 2008 ident: 10.1016/j.tcs.2012.02.016_br000120 article-title: Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability publication-title: Alg. Mol. Biol. – year: 2009 ident: 10.1016/j.tcs.2012.02.016_br000045 – ident: 10.1016/j.tcs.2012.02.016_br000005 doi: 10.1007/3-540-48481-7_28 – volume: 13 start-page: 964 issue: 7 year: 1996 ident: 10.1016/j.tcs.2012.02.016_br000115 article-title: Quartet puzzling: a quartet maximum-likelihood method for reconstructing tree topologies publication-title: Mol. Biol. Evol. doi: 10.1093/oxfordjournals.molbev.a025664 – year: 1995 ident: 10.1016/j.tcs.2012.02.016_br000095 – ident: 10.1016/j.tcs.2012.02.016_br000080 doi: 10.1007/3-540-49116-3_17 – volume: 15 start-page: 91 issue: 1 year: 2008 ident: 10.1016/j.tcs.2012.02.016_br000110 article-title: Short quartet puzzling: a new quartet-based phylogeny reconstruction algorithm publication-title: J. Comp. Biol. doi: 10.1089/cmb.2007.0103 – ident: 10.1016/j.tcs.2012.02.016_br000060 doi: 10.1007/11780441_5 – volume: 38 start-page: 377 issue: 2 year: 2003 ident: 10.1016/j.tcs.2012.02.016_br000010 article-title: Computing the quartet distance between evolutionary trees in time O(nlogn) publication-title: Algorithmica doi: 10.1007/s00453-003-1065-y – ident: 10.1016/j.tcs.2012.02.016_br000065 – ident: 10.1016/j.tcs.2012.02.016_br000090 – volume: 18 start-page: 1103 issue: 6 year: 2001 ident: 10.1016/j.tcs.2012.02.016_br000105 article-title: Quartet-based phylogenetic inference: improvements and limits publication-title: Mol. Biol. Evol. doi: 10.1093/oxfordjournals.molbev.a003881 – ident: 10.1016/j.tcs.2012.02.016_br000035 doi: 10.1007/978-3-642-02008-7_32 – ident: 10.1016/j.tcs.2012.02.016_br000020 doi: 10.1007/978-3-642-23038-7_2 – ident: 10.1016/j.tcs.2012.02.016_br000055 doi: 10.1145/100216.100230 – volume: 21 start-page: 26 issue: 1 year: 1996 ident: 10.1016/j.tcs.2012.02.016_br000075 article-title: Determining the evolutionary tree using experiments publication-title: J. Algorithms doi: 10.1006/jagm.1996.0035 – volume: 26 start-page: 1641 issue: 7 year: 2009 ident: 10.1016/j.tcs.2012.02.016_br000100 article-title: FastTree: computing large minimum evolution trees with profiles instead of a distance matrix publication-title: Mol. Biol. Evol. doi: 10.1093/molbev/msp077 – volume: 9 start-page: 277 issue: 2 year: 2002 ident: 10.1016/j.tcs.2012.02.016_br000030 article-title: Fast recovery of evolutionary trees with thousands of nodes publication-title: J. Comp. Biol. doi: 10.1089/10665270252935467 – ident: 10.1016/j.tcs.2012.02.016_br000025 – ident: 10.1016/j.tcs.2012.02.016_br000015 doi: 10.1007/978-3-642-21458-5_14 |
| SSID | ssj0000576 |
| Score | 2.0434484 |
| Snippet | We present a quartet-based phylogeny algorithm that returns the correct topology for n taxa in O(nlogn) time with high probability, assuming that each quartet... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 104 |
| Title | Fast error-tolerant quartet phylogeny algorithms |
| URI | https://dx.doi.org/10.1016/j.tcs.2012.02.016 |
| Volume | 483 |
| WOSCitedRecordID | wos000318890000011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1879-2294 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIEXJ dateStart: 19950109 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwEB7BlgMcKBQqChTlwImVV3Feto8V6oNKVEgUaW-R4zjQ7SqpEi8Ufj3jtZNduoAACcmyIitOLH-jmfFj5gN4mckqlegKEEYjXKAUmSQFDyXRaagV1VklKkc2wc7O-HQq3nmu9m5JJ8Dqml9fi6v_CjW2Idg2dPYv4B4-ig34jKBjjbBj_UfAH8nOjHXbNi0xzVyjLVqGTrZGG7uPgbpO11_Hcv6xaS_MJ5-sfDYIzRDWqDzfw9gbyY2Fu4tOHx9PhtV_u-i-XTZfPBX2qbxcFOu7CpbhISHRSndthru4ECt7jCIc1clEO43JmSBR5JiKe5Wa8HhNKXqCYW9fqQsa3VDdbhdhNjHKZlG3W7RY6I002UvD-96Oww6D2gthKQtvw1bEUsFHsHXw5nB6ujLFKXOH1X7c_bH28oLfjR_93DFZczbOH8B9v0oIDhy6D-GWrndgu2fgCLxC3oF7b4esu90jCC30wY_QBx76YIA-WEH_GD4cHZ6_PiGeEYOoOAkNQe-txMIVehWZZpLHisss1VxpHmNDRCuaqZKzSMtK01JSJcpYFIpWVVKyMt6FUd3U-gkEVSFtMslQSFkkVJRcc5ueMBEc-2cy3YOwn45c-XTxlrVknvf3Amc5zmBuZzAPsdBsD14NXa5crpTfvZz0c5x7OXZOXI4C8etuT_-t2zO4u5Ly5zAy7ULvwx312Vx07QsvNt8BQe94Hw |
| linkProvider | Elsevier |
| 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=Fast+error-tolerant+quartet+phylogeny+algorithms&rft.jtitle=Theoretical+computer+science&rft.au=Brown%2C+Daniel+G.&rft.au=Truszkowski%2C+Jakub&rft.date=2013-04-29&rft.pub=Elsevier+B.V&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=483&rft.spage=104&rft.epage=114&rft_id=info:doi/10.1016%2Fj.tcs.2012.02.016&rft.externalDocID=S0304397512001570 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |