{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:46:56Z","timestamp":1760244416215,"version":"build-2065373602"},"reference-count":6,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T00:00:00Z","timestamp":1672358400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>In the past decade, there has been an effort to sequence and compare a large number of individual genomes of a given species, resulting in a large number of (reference) genomes of various species being made publicly available [...]<\/jats:p>","DOI":"10.3390\/a16010021","type":"journal-article","created":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T03:18:18Z","timestamp":1672370298000},"page":"21","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Special Issue: Algorithms in Bioinformatics"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9509-9725","authenticated-orcid":false,"given":"Christina","family":"Boucher","sequence":"first","affiliation":[{"name":"Department of Computer and Information Science and Engineering, Herbert Wertheim College of Engineering, University of Florida, Gainesville, FL 32611-0570, USA"}]}],"member":"1968","published-online":{"date-parts":[[2022,12,30]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Brejov\u00e1, B., and Kr\u00e1lovi\u010d, R. (2020). A Linear-Time Algorithm for the Isometric Reconciliation of Unrooted Trees. Algorithms, 13.","DOI":"10.3390\/a13090225"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Abedin, P., K\u00fclekci, M.O., and Thankachan, S.V. (2020). A survey on shortest unique substring queries. Algorithms, 13.","DOI":"10.3390\/a13090224"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Bannai, H., Gagie, T., Hoppenworth, G., Puglisi, S.J., and Russo, L.M. (2020). More Time-Space Tradeoffs for Finding a Shortest Unique Substring. Algorithms, 13.","DOI":"10.3390\/a13090234"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Chen, C., Li, Z., Zhang, Y., Zhang, S., Hou, J., and Zhang, H. (2020). Low-Power FPGA Implementation of Convolution Neural Network Accelerator for Pulse Waveform Classification. Algorithms, 13.","DOI":"10.3390\/a13090213"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Abdel Samee, N.M. (2020). Classical and deep learning paradigms for detection and validation of key genes of risky outcomes of HCV. Algorithms, 13.","DOI":"10.3390\/a13030073"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Cumbo, F., Cappelli, E., and Weitschek, E. (2020). A brain-inspired hyperdimensional computing approach for classifying massive dna methylation data of cancer. Algorithms, 13.","DOI":"10.3390\/a13090233"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/1\/21\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:55:59Z","timestamp":1760147759000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/1\/21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,30]]},"references-count":6,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,1]]}},"alternative-id":["a16010021"],"URL":"https:\/\/doi.org\/10.3390\/a16010021","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2022,12,30]]}}}