@inproceedings{
 title = {Parallel implementation and performance of fastDNAml},
 type = {inproceedings},
 year = {2001},
 pages = {20-20},
 websites = {http://portal.acm.org/citation.cfm?doid=582034.582054},
 publisher = {ACM Press},
 city = {New York, New York, USA},
 id = {9f256222-3ea4-344a-b90b-d3362a7a49fa},
 created = {2018-02-27T18:07:30.011Z},
 file_attached = {false},
 profile_id = {42d295c0-0737-38d6-8b43-508cab6ea85d},
 group_id = {27e0553c-8ec0-31bd-b42c-825b8a5a9ae8},
 last_modified = {2019-09-12T20:15:52.817Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {true},
 hidden = {false},
 citation_key = {Stewart2001f},
 source_type = {CONF},
 private_publication = {false},
 abstract = {This paper describes the parallel implementation of fastDNAml, a program for the maximum likelihood inference of phylogenetic trees from DNA sequence data. Mathematical means of inferring phylogenetic trees have been made possible by the wealth of DNA data now available. Maximum likelihood analysis of phylogenetic trees is extremely computationally intensive. Availability of computer resources is a key factor limiting use of such analyses. fastDNAml is implemented in serial, PVM, and MPI versions, and may be modified to use other message passing libraries in the future. We have developed a viewer for comparing phylogenies. We tested the scaling behavior of fastDNAml on an IBM RS/6000 SP up to 64 processors. The parallel version of fastDNAml is one of very few computational phylogenetics codes that scale well. fastDNAml is available for download as source code or compiled for Linux or AIX.},
 bibtype = {inproceedings},
 author = {Stewart, Craig A and Hart, David and Berry, Donald K and Olsen, Gary J and Wernert, Eric A and Fischer, William},
 doi = {10.1145/582034.582054},
 booktitle = {Proceedings of the 2001 ACM/IEEE conference on Supercomputing (CDROM) - Supercomputing '01}
}

{"_id":"MhrehTRZqLWr2ktPZ","bibbaseid":"stewart-hart-berry-olsen-wernert-fischer-parallelimplementationandperformanceoffastdnaml-2001","authorIDs":[],"author_short":["Stewart, C., A.","Hart, D.","Berry, D., K.","Olsen, G., J.","Wernert, E., A.","Fischer, W."],"bibdata":{"title":"Parallel implementation and performance of fastDNAml","type":"inproceedings","year":"2001","pages":"20-20","websites":"http://portal.acm.org/citation.cfm?doid=582034.582054","publisher":"ACM Press","city":"New York, New York, USA","id":"9f256222-3ea4-344a-b90b-d3362a7a49fa","created":"2018-02-27T18:07:30.011Z","file_attached":false,"profile_id":"42d295c0-0737-38d6-8b43-508cab6ea85d","group_id":"27e0553c-8ec0-31bd-b42c-825b8a5a9ae8","last_modified":"2019-09-12T20:15:52.817Z","read":false,"starred":false,"authored":false,"confirmed":"true","hidden":false,"citation_key":"Stewart2001f","source_type":"CONF","private_publication":false,"abstract":"This paper describes the parallel implementation of fastDNAml, a program for the maximum likelihood inference of phylogenetic trees from DNA sequence data. Mathematical means of inferring phylogenetic trees have been made possible by the wealth of DNA data now available. Maximum likelihood analysis of phylogenetic trees is extremely computationally intensive. Availability of computer resources is a key factor limiting use of such analyses. fastDNAml is implemented in serial, PVM, and MPI versions, and may be modified to use other message passing libraries in the future. We have developed a viewer for comparing phylogenies. We tested the scaling behavior of fastDNAml on an IBM RS/6000 SP up to 64 processors. The parallel version of fastDNAml is one of very few computational phylogenetics codes that scale well. fastDNAml is available for download as source code or compiled for Linux or AIX.","bibtype":"inproceedings","author":"Stewart, Craig A and Hart, David and Berry, Donald K and Olsen, Gary J and Wernert, Eric A and Fischer, William","doi":"10.1145/582034.582054","booktitle":"Proceedings of the 2001 ACM/IEEE conference on Supercomputing (CDROM) - Supercomputing '01","bibtex":"@inproceedings{\n title = {Parallel implementation and performance of fastDNAml},\n type = {inproceedings},\n year = {2001},\n pages = {20-20},\n websites = {http://portal.acm.org/citation.cfm?doid=582034.582054},\n publisher = {ACM Press},\n city = {New York, New York, USA},\n id = {9f256222-3ea4-344a-b90b-d3362a7a49fa},\n created = {2018-02-27T18:07:30.011Z},\n file_attached = {false},\n profile_id = {42d295c0-0737-38d6-8b43-508cab6ea85d},\n group_id = {27e0553c-8ec0-31bd-b42c-825b8a5a9ae8},\n last_modified = {2019-09-12T20:15:52.817Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n citation_key = {Stewart2001f},\n source_type = {CONF},\n private_publication = {false},\n abstract = {This paper describes the parallel implementation of fastDNAml, a program for the maximum likelihood inference of phylogenetic trees from DNA sequence data. Mathematical means of inferring phylogenetic trees have been made possible by the wealth of DNA data now available. Maximum likelihood analysis of phylogenetic trees is extremely computationally intensive. Availability of computer resources is a key factor limiting use of such analyses. fastDNAml is implemented in serial, PVM, and MPI versions, and may be modified to use other message passing libraries in the future. We have developed a viewer for comparing phylogenies. We tested the scaling behavior of fastDNAml on an IBM RS/6000 SP up to 64 processors. The parallel version of fastDNAml is one of very few computational phylogenetics codes that scale well. fastDNAml is available for download as source code or compiled for Linux or AIX.},\n bibtype = {inproceedings},\n author = {Stewart, Craig A and Hart, David and Berry, Donald K and Olsen, Gary J and Wernert, Eric A and Fischer, William},\n doi = {10.1145/582034.582054},\n booktitle = {Proceedings of the 2001 ACM/IEEE conference on Supercomputing (CDROM) - Supercomputing '01}\n}","author_short":["Stewart, C., A.","Hart, D.","Berry, D., K.","Olsen, G., J.","Wernert, E., A.","Fischer, W."],"urls":{"Website":"http://portal.acm.org/citation.cfm?doid=582034.582054"},"biburl":"https://bibbase.org/service/mendeley/42d295c0-0737-38d6-8b43-508cab6ea85d","bibbaseid":"stewart-hart-berry-olsen-wernert-fischer-parallelimplementationandperformanceoffastdnaml-2001","role":"author","metadata":{"authorlinks":{}},"downloads":1},"bibtype":"inproceedings","creationDate":"2019-09-14T15:29:57.900Z","downloads":1,"keywords":[],"search_terms":["parallel","implementation","performance","fastdnaml","stewart","hart","berry","olsen","wernert","fischer"],"title":"Parallel implementation and performance of fastDNAml","year":2001,"biburl":"https://bibbase.org/service/mendeley/42d295c0-0737-38d6-8b43-508cab6ea85d","dataSources":["zgahneP4uAjKbudrQ","ya2CyA73rpZseyrZ8","2252seNhipfTmjEBQ"]}