{"id":"https://openalex.org/W7100034591","doi":null,"title":"RAxML-OMP: An efficient program for phylogenetic inference on SMPs","display_name":"RAxML-OMP: An efficient program for phylogenetic inference on SMPs","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W7100034591"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.88.8900","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.8900","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://icwww.epfl.ch/~stamatak/index-Dateien/publications/PACT2005.PDF","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ros Stamatakis","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ros Stamatakis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Thomas Ludwig","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thomas Ludwig","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.6205999851226807,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.6205999851226807,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.37209999561309814,"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/T10521","display_name":"RNA and protein synthesis mechanisms","score":0.0008999999845400453,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/phylogenetic-reconstruction","display_name":"phylogenetic inference","score":0.925000011920929},{"id":"https://openalex.org/keywords/maximum-likelihood-estimation","display_name":"maximum likelihood estimation","score":0.8740000128746033},{"id":"https://openalex.org/keywords/openmp-parallelization","display_name":"OpenMP parallelization","score":0.9110000133514404},{"id":"https://openalex.org/keywords/symmetric-multiprocessing","display_name":"symmetric multiprocessing","score":0.7950000166893005},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"simulated annealing","score":0.7549999952316284},{"id":"https://openalex.org/keywords/hill-climbing-search","display_name":"hill-climbing search","score":0.8849999904632568},{"id":"https://openalex.org/keywords/superlinear-speedup","display_name":"superlinear speedup","score":0.8769999742507935},{"id":"https://openalex.org/keywords/cache-efficiency","display_name":"cache efficiency","score":0.871999979019165},{"id":"https://openalex.org/keywords/data-locality","display_name":"data locality","score":0.5210000276565552},{"id":"https://openalex.org/keywords/intel-xeon","display_name":"Intel Xeon","score":0.6549999713897705},{"id":"https://openalex.org/keywords/amd-opteron","display_name":"AMD Opteron","score":1.0}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7735999822616577},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.6309999823570251},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.47769999504089355},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4196999967098236},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.41600000858306885},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.4097999930381775},{"id":"https://openalex.org/C193252679","wikidata":"https://www.wikidata.org/wiki/Q242125","display_name":"Phylogenetic tree","level":3,"score":0.3718000054359436},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3628000020980835},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.31290000677108765},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2994999885559082},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29409998655319214},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.29409998655319214},{"id":"https://openalex.org/C123657996","wikidata":"https://www.wikidata.org/wiki/Q12271","display_name":"Architecture","level":2,"score":0.28619998693466187},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2840000092983246},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2815999984741211},{"id":"https://openalex.org/C46743427","wikidata":"https://www.wikidata.org/wiki/Q1341685","display_name":"Inference engine","level":3,"score":0.28049999475479126},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.2743000090122223},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.25929999351501465},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2590000033378601},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2572999894618988},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.25619998574256897},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.25600001215934753},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.25279998779296875}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.88.8900","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.8900","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://icwww.epfl.ch/~stamatak/index-Dateien/publications/PACT2005.PDF","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2168696662","https://openalex.org/W7100482746","https://openalex.org/W7099061702","https://openalex.org/W1024355031","https://openalex.org/W2046321131","https://openalex.org/W2128766881","https://openalex.org/W188009269","https://openalex.org/W7097423509","https://openalex.org/W65005202","https://openalex.org/W2245010542"],"abstract_inverted_index":{"Abstract.":[0],"Inference":[1],"of":[2,10,55,78],"phylogenetic":[3],"trees":[4,57],"comprising":[5],"hundreds":[6],"or":[7],"even":[8,103],"thousands":[9],"organisms":[11],"based":[12,39,58],"on":[13,40,80,96],"the":[14,41,60,81,97],"Maximum":[15,47],"Likelihood":[16],"(ML)":[17],"method":[18,62],"is":[19,50,124],"computationally":[20],"extremely":[21],"intensive.":[22],"In":[23],"order":[24],"to":[25,117],"accelerate":[26],"computations":[27],"we":[28],"implemented":[29],"RAxML-OMP,":[30],"an":[31],"efficient":[32],"OpenMP-parallelization":[33],"for":[34,53,106],"Symmetric":[35],"Multi-Processing":[36],"machines":[37],"(SMPs)":[38],"sequential":[42],"program":[43,52],"RAxML-V":[44,49],"(Randomized":[45],"Axelerated":[46],"Likelihood).":[48],"a":[51,110],"inference":[54],"evolutionary":[56],"upon":[59],"ML":[61],"and":[63,72,88,101,120],"incorporates":[64],"several":[65],"advanced":[66],"search":[67],"algorithms":[68],"like":[69],"fast":[70],"hill-climbing":[71],"simulated":[73],"annealing.":[74],"We":[75],"assess":[76],"performance":[77],"RAxML-OMP":[79,92,123],"widely":[82],"used":[83],"Intel":[84,86],"Xeon,":[85],"Itanium,":[87],"AMD":[89,98],"Opteron":[90,99],"architectures.":[91],"scales":[93],"particularly":[94],"well":[95],"architecture":[100],"achieves":[102],"super-linear":[104],"speedups":[105],"large":[107],"datasets":[108],"(with":[109],"length":[111],"\u2265":[112],"5.000":[113],"base":[114],"pairs)":[115],"due":[116],"improved":[118],"cache-efficiency":[119],"data":[121],"locality.":[122],"freely":[125],"available":[126],"as":[127],"open":[128],"source":[129],"code.":[130],"1":[131]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-27T00:00:00"}