Version DOI Comment Publication Date
1 10.13012/B2IDB-1616387_V1 2018-02-22
2.22 KB File
20.6 MB File

Contact the Research Data Service for help interpreting this log.

update: {"citation"=>["Sarah Christensen, Erin K. Molloy, Pranjal Vachaspati and Tandy Warnow. OCTAL: Optimal Completion of gene trees in polynomial time. Algorithms for Molecular Biology201813:6. https://doi.org/10.1186/s13015-018-0124-5\r\n", "Sarah Christensen, Erin K. Molloy, Pranjal Vachaspati and Tandy Warnow. OCTAL: Optimal Completion of gene trees in polynomial time. Algorithms for Molecular Biology 2018, 13:6. https://doi.org/10.1186/s13015-018-0124-5\r\n"]} 2018-03-21T00:55:53Z
create: {"material_type"=>"Article", "availability"=>nil, "link"=>"https://doi.org/10.1186/s13015-018-0124-5", "uri"=>"10.1186/s13015-018-0124-5", "uri_type"=>"DOI", "citation"=>"Sarah Christensen, Erin K. Molloy, Pranjal Vachaspati and Tandy Warnow. OCTAL: Optimal Completion of gene trees in polynomial time. Algorithms for Molecular Biology201813:6. https://doi.org/10.1186/s13015-018-0124-5\r\n", "dataset_id"=>483, "selected_type"=>"Article", "datacite_list"=>"IsSupplementTo"} 2018-03-21T00:55:09Z
update: {"description"=>["Datasets used in the study, \"OCTAL: Optimal Completion of Gene Trees in Polynomial Time,\" under review at Algorithms for Molecular Biology", "Datasets used in the study, \"OCTAL: Optimal Completion of Gene Trees in Polynomial Time,\" under review at Algorithms for Molecular Biology. Note: DS_STORE file in 25gen-10M folder can be disregarded. "], "version_comment"=>[nil, ""]} 2018-02-27T18:15:16Z
update: {"publication_state"=>["draft", "released"], "identifier"=>["", "10.13012/B2IDB-1616387_V1"]} 2018-02-22T22:23:33Z