{"id":"https://openalex.org/W1502506658","doi":"https://doi.org/10.1109/ipdps.2003.1213296","title":"Phylogenetic tree inference on PC architectures with AxML/PAxML","display_name":"Phylogenetic tree inference on PC architectures with AxML/PAxML","publication_year":2004,"publication_date":"2004-03-22","ids":{"openalex":"https://openalex.org/W1502506658","doi":"https://doi.org/10.1109/ipdps.2003.1213296","mag":"1502506658"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2003.1213296","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2003.1213296","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Parallel and Distributed Processing Symposium","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025640090","display_name":"Alexandros Stamatakis","orcid":"https://orcid.org/0000-0003-0353-0691"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"A.P. Stamatakis","raw_affiliation_strings":["Department of Computer Science, Technical University Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technical University Munich, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083991929","display_name":"Thomas Ludwig","orcid":"https://orcid.org/0000-0003-4020-6321"},"institutions":[{"id":"https://openalex.org/I223822909","display_name":"Heidelberg University","ror":"https://ror.org/038t36y30","country_code":"DE","type":"education","lineage":["https://openalex.org/I223822909"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"T. Ludwig","raw_affiliation_strings":["Department of Computer Science, Ruprecht Karls University of Heidelberg, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Ruprecht Karls University of Heidelberg, Germany","institution_ids":["https://openalex.org/I223822909"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025640090"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":1.2059,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.75781354,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"8","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12254","display_name":"Machine Learning in Bioinformatics","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11764","display_name":"Evolution and Genetic Dynamics","score":0.9854000210762024,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7274890542030334},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7105996608734131},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.6146002411842346},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.594486653804779},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5522428154945374},{"id":"https://openalex.org/keywords/rendering","display_name":"Rendering (computer graphics)","score":0.5522197484970093},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.550244152545929},{"id":"https://openalex.org/keywords/phylogenetic-tree","display_name":"Phylogenetic tree","score":0.5067227482795715},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.4646797776222229},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4633866250514984},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45193278789520264},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40824636816978455},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32705825567245483},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23695912957191467},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1599007248878479},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1158774197101593}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7274890542030334},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7105996608734131},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.6146002411842346},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.594486653804779},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5522428154945374},{"id":"https://openalex.org/C205711294","wikidata":"https://www.wikidata.org/wiki/Q176953","display_name":"Rendering (computer graphics)","level":2,"score":0.5522197484970093},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.550244152545929},{"id":"https://openalex.org/C193252679","wikidata":"https://www.wikidata.org/wiki/Q242125","display_name":"Phylogenetic tree","level":3,"score":0.5067227482795715},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4646797776222229},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4633866250514984},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45193278789520264},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40824636816978455},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32705825567245483},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23695912957191467},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1599007248878479},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1158774197101593},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/ipdps.2003.1213296","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2003.1213296","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Parallel and Distributed Processing Symposium","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.12.3477","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.3477","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.hicomb.org/HiCOMB2002/papers/HICOMB2003-12.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.332.9541","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.332.9541","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lrr.in.tum.de/~stamatak/publications/hicomb2003.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W2050715005","https://openalex.org/W2101088466","https://openalex.org/W2102424972","https://openalex.org/W2105926960","https://openalex.org/W2124260482","https://openalex.org/W2126568132","https://openalex.org/W2134696203","https://openalex.org/W2278883706","https://openalex.org/W6695162554","https://openalex.org/W7042482565"],"related_works":["https://openalex.org/W1709331905","https://openalex.org/W3012609114","https://openalex.org/W15723410","https://openalex.org/W4297260888","https://openalex.org/W2003327526","https://openalex.org/W1838573249","https://openalex.org/W2048012077","https://openalex.org/W4226218108","https://openalex.org/W2378001377","https://openalex.org/W4254131023"],"abstract_inverted_index":{"Inference":[0],"of":[1,9,36,54,113,117,126,138],"phylogenetic":[2],"trees":[3,177],"comprising":[4],"hundreds":[5],"or":[6],"even":[7],"thousands":[8],"organisms":[10],"based":[11],"on":[12,65,104],"the":[13,34,88,123,136,145,183],"maximum":[14],"likelihood":[15],"method":[16,47],"is":[17,51],"computationally":[18],"extremely":[19],"expensive.":[20],"In":[21,91],"previous":[22],"work,":[23],"we":[24,94,129,153],"have":[25],"introduced":[26],"subtree":[27],"equality":[28],"vectors":[29],"(SEV)":[30],"to":[31,109,119,122,150],"significantly":[32],"reduce":[33],"number":[35,137],"required":[37],"floating":[38],"point":[39],"operations":[40],"during":[41],"topology":[42],"evaluation":[43],"and":[44,76,107,160,178],"implemented":[45],"this":[46,92],"in":[48],"(P)AxML,":[49],"which":[50,101,142,170],"a":[52,110,155,187],"derivative":[53],"(parallel)":[55,79],"fastDNAml.":[56],"Experimental":[57],"results":[58],"show":[59],"that":[60],"(P)AxML":[61],"scales":[62,102],"particularly":[63],"well":[64,103],"inexpensive":[66],"PC-processor":[67],"architectures":[68],"obtaining":[69],"global":[70,114],"run":[71],"time":[72,185],"accelerations":[73],"between":[74],"51%":[75],"65%":[77],"over":[78],"fastDNAml":[80],"for":[81,134,164,171],"large":[82,166],"data":[83],"sets,":[84],"yet":[85],"rendering":[86],"exactly":[87],"same":[89,184],"output.":[90],"paper,":[93],"present":[95,130],"an":[96],"additional":[97],"SEV-based":[98],"algorithmic":[99],"optimization":[100],"PC":[105],"processors":[106],"leads":[108],"further":[111,143],"improvement":[112],"execution":[115,181],"times":[116],"14%":[118],"19%":[120],"compared":[121],"initial":[124,173],"version":[125],"AxML.":[127],"Furthermore,":[128],"novel":[131,156],"distance-based":[132],"heuristics":[133],"reducing":[135],"analyzed":[139],"tree":[140],"topologies,":[141],"accelerate":[144],"program":[146,180],"by":[147,186],"4%":[148],"up":[149],"8%.":[151],"Finally,":[152],"discuss":[154],"experimental":[157],"tree-building":[158],"algorithm":[159],"potential":[161],"heuristic":[162],"solutions":[163],"inferring":[165],"high":[167],"quality":[168],"trees,":[169],"some":[172],"tests":[174],"rendered":[175],"better":[176],"accelerated":[179],"at":[182],"factor":[188],"greater":[189],"than":[190],"6.":[191]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}