Quick path finding—Quick algorithmic solution for unambiguous labeling of phylogenetic tree nodes
Ever increasing amounts of genetic information stored in sequential databases require efficient methods to automatically reveal their phylogenetic relationships. A framework for in silico unambiguous analysis of phylogenetic trees, based on information contained in tree's topology, together wit...
Gespeichert in:
| Veröffentlicht in: | Computational biology and chemistry 2010-12, Vol.34 (5), p.300-307 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 307 |
|---|---|
| container_issue | 5 |
| container_start_page | 300 |
| container_title | Computational biology and chemistry |
| container_volume | 34 |
| creator | Płoński, Piotr Radomski, Jan P. |
| description | Ever increasing amounts of genetic information stored in sequential databases require efficient methods to automatically reveal their phylogenetic relationships. A framework for in silico unambiguous analysis of phylogenetic trees, based on information contained in tree's topology, together with its branches length, is proposed. The resulting, translated tree has all nodes labeled, with no constraints on nodes’ degree, and the subsequent finding of evolutionary pathways from the QPF-translated tree is robust and straightforward. Main features of the method are: small demands on computational time, and the ability to analyze phylogenies obtained prior to the proposed QPF analysis by any traditional tree-building technique. |
| doi_str_mv | 10.1016/j.compbiolchem.2010.10.002 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_812130588</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S1476927110000769</els_id><sourcerecordid>812130588</sourcerecordid><originalsourceid>FETCH-LOGICAL-c379t-5b14802f37bf56de088c24cf3f4fd17ede895d5d878c88d9ee4c6da2956b5df73</originalsourceid><addsrcrecordid>eNqNkMtKAzEUhoMotlZfQYIbV61J5pZxJ96hIIKCuzCTnLSpmcmYzAjd-RA-oU_i1Nbi0lVCzvfnnPMhdELJhBKani0m0lVNaZyVc6gmjPwUJoSwHTSkcZaOc8Zfdrf3jA7QQQiLHogISfbRgJGcE0bYEMnHzshX3BTtHGtTK1PPvj4-14-FnTlv2nllJA7Odq1xNdbO464uqtLMOtcFbIsSbJ_CTuNmvrRuBjW0faL1ALh2CsIh2tOFDXC0OUfo-eb66fJuPH24vb-8mI5llOXtOClp3E-lo6zUSaqAcC5ZLHWkY61oBgp4nqhE8YxLzlUOEMtUFSxP0jJROotG6HT9b-PdWwehFZUJEqwtauhHFZwyGpGE8548X5PSuxA8aNF4UxV-KSgRK8diIf46FivHq9pK4Qgdb9p0ZQVqG_2V2gNXawD6Zd8NeBGkgVqCMh5kK5Qz_-nzDe95l_s</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>812130588</pqid></control><display><type>article</type><title>Quick path finding—Quick algorithmic solution for unambiguous labeling of phylogenetic tree nodes</title><source>Elsevier ScienceDirect Journals Complete - AutoHoldings</source><source>MEDLINE</source><creator>Płoński, Piotr ; Radomski, Jan P.</creator><creatorcontrib>Płoński, Piotr ; Radomski, Jan P.</creatorcontrib><description>Ever increasing amounts of genetic information stored in sequential databases require efficient methods to automatically reveal their phylogenetic relationships. A framework for in silico unambiguous analysis of phylogenetic trees, based on information contained in tree's topology, together with its branches length, is proposed. The resulting, translated tree has all nodes labeled, with no constraints on nodes’ degree, and the subsequent finding of evolutionary pathways from the QPF-translated tree is robust and straightforward. Main features of the method are: small demands on computational time, and the ability to analyze phylogenies obtained prior to the proposed QPF analysis by any traditional tree-building technique.</description><identifier>ISSN: 1476-9271</identifier><identifier>EISSN: 1476-928X</identifier><identifier>DOI: 10.1016/j.compbiolchem.2010.10.002</identifier><identifier>PMID: 20980202</identifier><language>eng</language><publisher>England: Elsevier Ltd</publisher><subject>Algorithms ; Automatic node labeling ; Computer Simulation ; Databases, Genetic ; Evolution, Molecular ; Genetic Variation ; Neighbor joining algorithm ; Newick format ; Phylogenetic analysis ; Phylogenetic tree ; Phylogeny ; Quick path finding algorithm</subject><ispartof>Computational biology and chemistry, 2010-12, Vol.34 (5), p.300-307</ispartof><rights>2010 Elsevier Ltd</rights><rights>Copyright © 2010 Elsevier Ltd. All rights reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c379t-5b14802f37bf56de088c24cf3f4fd17ede895d5d878c88d9ee4c6da2956b5df73</citedby><cites>FETCH-LOGICAL-c379t-5b14802f37bf56de088c24cf3f4fd17ede895d5d878c88d9ee4c6da2956b5df73</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.compbiolchem.2010.10.002$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3549,27923,27924,45994</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/20980202$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><creatorcontrib>Płoński, Piotr</creatorcontrib><creatorcontrib>Radomski, Jan P.</creatorcontrib><title>Quick path finding—Quick algorithmic solution for unambiguous labeling of phylogenetic tree nodes</title><title>Computational biology and chemistry</title><addtitle>Comput Biol Chem</addtitle><description>Ever increasing amounts of genetic information stored in sequential databases require efficient methods to automatically reveal their phylogenetic relationships. A framework for in silico unambiguous analysis of phylogenetic trees, based on information contained in tree's topology, together with its branches length, is proposed. The resulting, translated tree has all nodes labeled, with no constraints on nodes’ degree, and the subsequent finding of evolutionary pathways from the QPF-translated tree is robust and straightforward. Main features of the method are: small demands on computational time, and the ability to analyze phylogenies obtained prior to the proposed QPF analysis by any traditional tree-building technique.</description><subject>Algorithms</subject><subject>Automatic node labeling</subject><subject>Computer Simulation</subject><subject>Databases, Genetic</subject><subject>Evolution, Molecular</subject><subject>Genetic Variation</subject><subject>Neighbor joining algorithm</subject><subject>Newick format</subject><subject>Phylogenetic analysis</subject><subject>Phylogenetic tree</subject><subject>Phylogeny</subject><subject>Quick path finding algorithm</subject><issn>1476-9271</issn><issn>1476-928X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><sourceid>EIF</sourceid><recordid>eNqNkMtKAzEUhoMotlZfQYIbV61J5pZxJ96hIIKCuzCTnLSpmcmYzAjd-RA-oU_i1Nbi0lVCzvfnnPMhdELJhBKani0m0lVNaZyVc6gmjPwUJoSwHTSkcZaOc8Zfdrf3jA7QQQiLHogISfbRgJGcE0bYEMnHzshX3BTtHGtTK1PPvj4-14-FnTlv2nllJA7Odq1xNdbO464uqtLMOtcFbIsSbJ_CTuNmvrRuBjW0faL1ALh2CsIh2tOFDXC0OUfo-eb66fJuPH24vb-8mI5llOXtOClp3E-lo6zUSaqAcC5ZLHWkY61oBgp4nqhE8YxLzlUOEMtUFSxP0jJROotG6HT9b-PdWwehFZUJEqwtauhHFZwyGpGE8548X5PSuxA8aNF4UxV-KSgRK8diIf46FivHq9pK4Qgdb9p0ZQVqG_2V2gNXawD6Zd8NeBGkgVqCMh5kK5Qz_-nzDe95l_s</recordid><startdate>20101201</startdate><enddate>20101201</enddate><creator>Płoński, Piotr</creator><creator>Radomski, Jan P.</creator><general>Elsevier Ltd</general><scope>CGR</scope><scope>CUY</scope><scope>CVF</scope><scope>ECM</scope><scope>EIF</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7X8</scope></search><sort><creationdate>20101201</creationdate><title>Quick path finding—Quick algorithmic solution for unambiguous labeling of phylogenetic tree nodes</title><author>Płoński, Piotr ; Radomski, Jan P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c379t-5b14802f37bf56de088c24cf3f4fd17ede895d5d878c88d9ee4c6da2956b5df73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Algorithms</topic><topic>Automatic node labeling</topic><topic>Computer Simulation</topic><topic>Databases, Genetic</topic><topic>Evolution, Molecular</topic><topic>Genetic Variation</topic><topic>Neighbor joining algorithm</topic><topic>Newick format</topic><topic>Phylogenetic analysis</topic><topic>Phylogenetic tree</topic><topic>Phylogeny</topic><topic>Quick path finding algorithm</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Płoński, Piotr</creatorcontrib><creatorcontrib>Radomski, Jan P.</creatorcontrib><collection>Medline</collection><collection>MEDLINE</collection><collection>MEDLINE (Ovid)</collection><collection>MEDLINE</collection><collection>MEDLINE</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>MEDLINE - Academic</collection><jtitle>Computational biology and chemistry</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Płoński, Piotr</au><au>Radomski, Jan P.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Quick path finding—Quick algorithmic solution for unambiguous labeling of phylogenetic tree nodes</atitle><jtitle>Computational biology and chemistry</jtitle><addtitle>Comput Biol Chem</addtitle><date>2010-12-01</date><risdate>2010</risdate><volume>34</volume><issue>5</issue><spage>300</spage><epage>307</epage><pages>300-307</pages><issn>1476-9271</issn><eissn>1476-928X</eissn><abstract>Ever increasing amounts of genetic information stored in sequential databases require efficient methods to automatically reveal their phylogenetic relationships. A framework for in silico unambiguous analysis of phylogenetic trees, based on information contained in tree's topology, together with its branches length, is proposed. The resulting, translated tree has all nodes labeled, with no constraints on nodes’ degree, and the subsequent finding of evolutionary pathways from the QPF-translated tree is robust and straightforward. Main features of the method are: small demands on computational time, and the ability to analyze phylogenies obtained prior to the proposed QPF analysis by any traditional tree-building technique.</abstract><cop>England</cop><pub>Elsevier Ltd</pub><pmid>20980202</pmid><doi>10.1016/j.compbiolchem.2010.10.002</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1476-9271 |
| ispartof | Computational biology and chemistry, 2010-12, Vol.34 (5), p.300-307 |
| issn | 1476-9271 1476-928X |
| language | eng |
| recordid | cdi_proquest_miscellaneous_812130588 |
| source | Elsevier ScienceDirect Journals Complete - AutoHoldings; MEDLINE |
| subjects | Algorithms Automatic node labeling Computer Simulation Databases, Genetic Evolution, Molecular Genetic Variation Neighbor joining algorithm Newick format Phylogenetic analysis Phylogenetic tree Phylogeny Quick path finding algorithm |
| title | Quick path finding—Quick algorithmic solution for unambiguous labeling of phylogenetic tree nodes |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T08%3A32%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Quick%20path%20finding%E2%80%94Quick%20algorithmic%20solution%20for%20unambiguous%20labeling%20of%20phylogenetic%20tree%20nodes&rft.jtitle=Computational%20biology%20and%20chemistry&rft.au=P%C5%82o%C5%84ski,%20Piotr&rft.date=2010-12-01&rft.volume=34&rft.issue=5&rft.spage=300&rft.epage=307&rft.pages=300-307&rft.issn=1476-9271&rft.eissn=1476-928X&rft_id=info:doi/10.1016/j.compbiolchem.2010.10.002&rft_dat=%3Cproquest_cross%3E812130588%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=812130588&rft_id=info:pmid/20980202&rft_els_id=S1476927110000769&rfr_iscdi=true |