{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:40:23Z","timestamp":1760218823511,"version":"build-2065373602"},"reference-count":6,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2014,3,25]],"date-time":"2014-03-25T00:00:00Z","timestamp":1395705600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>This special issue of Algorithms is dedicated to approaches to biological sequence analysis that have algorithmic novelty and potential for fundamental impact in methods used for genome research.<\/jats:p>","DOI":"10.3390\/a7010186","type":"journal-article","created":{"date-parts":[[2014,3,25]],"date-time":"2014-03-25T06:04:53Z","timestamp":1395727493000},"page":"186-187","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Editorial: Special Issue on Algorithms for Sequence Analysis and Storage"],"prefix":"10.3390","volume":"7","author":[{"given":"Veli","family":"M\u00e4kinen","sequence":"first","affiliation":[{"name":"Helsinki Institute for Information Technology HIIT, Department of Computer Science, P. O. Box 68 (Gustaf H\u00e4llstr\u00f6min katu 2b), University of Helsinki, Helsinki 00014, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2014,3,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"309","DOI":"10.3390\/a6020309","article-title":"Multi-Sided Compression Performance Assessment of ABI SOLiD WES Data","volume":"6","author":"Mazza","year":"2013","journal-title":"Algorithms"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"319","DOI":"10.3390\/a6020319","article-title":"Practical Compressed Suffix Trees","volume":"6","author":"Abeliuk","year":"2013","journal-title":"Algorithms"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"352","DOI":"10.3390\/a6020352","article-title":"Filtering Degenerate Patterns with Application to Protein Sequence Analysis","volume":"6","author":"Comin","year":"2013","journal-title":"Algorithms"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"636","DOI":"10.3390\/a6040636","article-title":"Sublinear Time Motif Discovery from Multiple Sequences","volume":"6","author":"Fu","year":"2013","journal-title":"Algorithms"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"430","DOI":"10.3390\/a6030430","article-title":"Efficient in silico Chromosomal Representation of Populations via Indexing Ancestral Genomes","volume":"6","author":"Haiminen","year":"2013","journal-title":"Algorithms"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"62","DOI":"10.3390\/a7010062","article-title":"Modeling Dynamic Programming Problems over Sequences and Trees with Inverse Coupled Rewrite Systems","volume":"7","author":"Giegerich","year":"2014","journal-title":"Algorithms"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/7\/1\/186\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:09:35Z","timestamp":1760216975000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/7\/1\/186"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,25]]},"references-count":6,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2014,3]]}},"alternative-id":["a7010186"],"URL":"https:\/\/doi.org\/10.3390\/a7010186","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2014,3,25]]}}}