{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:02:23Z","timestamp":1742950943167,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581114"},{"type":"electronic","value":"9783030581121"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58112-1_27","type":"book-chapter","created":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T16:04:30Z","timestamp":1599062670000},"page":"390-403","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Evaluation of a Permutation-Based Evolutionary Framework for Lyndon Factorizations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5783-8432","authenticated-orcid":false,"given":"Lily","family":"Major","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8315-3659","authenticated-orcid":false,"given":"Amanda","family":"Clare","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1123-8703","authenticated-orcid":false,"given":"Jacqueline W.","family":"Daykin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2945-3519","authenticated-orcid":false,"given":"Benjamin","family":"Mora","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7034-8438","authenticated-orcid":false,"given":"Leonel Jose","family":"Pe\u00f1a Gamboa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2829-4296","authenticated-orcid":false,"given":"Christine","family":"Zarges","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,31]]},"reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1073\/pnas.55.1.147","volume":"55","author":"JM Adams","year":"1966","unstructured":"Adams, J.M., Capecchi, M.R.: N-formylmethionyl-sRNA as the initiator of protein synthesis. Proc. Natl. Acad. Sci. USA 55(1), 147\u2013155 (1966). \nhttps:\/\/doi.org\/10.1073\/pnas.55.1.147","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"27_CR2","unstructured":"Bannai, H., K\u00e4rkk\u00e4inen, J., K\u00f6ppl, D., Piatkowski, M.: Indexing the bijective BWT. In: 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), pp. 17:1\u201317:14. Leibniz International Proceedings in Informatics (LIPIcs) (2019)"},{"key":"27_CR3","unstructured":"Bentley, J., Gibney, D., Thankachan, S.V.: On the complexity of BWT-runs minimization via alphabet reordering. \narXiv:1911.03035v2\n\n (2019)"},{"key":"27_CR4","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Technical report, Digital Systems Research Center, Palo Alto (1994). \nhttps:\/\/www.hpl.hp.com\/techreports\/Compaq-DEC\/SRC-RR-124.pdf"},{"key":"27_CR5","doi-asserted-by":"publisher","unstructured":"Chapin, B., Tate, S.R.: Higher compression from the Burrows-Wheeler Transform by modified sorting. In: Data Compression Conference, DCC 1998, Snowbird, Utah, USA, 30 March\u20131 April 1998, p. 532. IEEE Computer Society (1998). \nhttps:\/\/doi.org\/10.1109\/DCC.1998.672253","DOI":"10.1109\/DCC.1998.672253"},{"issue":"9","key":"27_CR6","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/s00500-004-0387-2","volume":"8","author":"M Chemillier","year":"2004","unstructured":"Chemillier, M.: Periodic musical sequences and Lyndon words. Soft. Comput. 8(9), 611\u2013616 (2004). \nhttps:\/\/doi.org\/10.1007\/s00500-004-0387-2","journal-title":"Soft. Comput."},{"issue":"1","key":"27_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/1970044","volume":"68","author":"KT Chen","year":"1958","unstructured":"Chen, K.T., Fox, R.H., Lyndon, R.C.: Free differential calculus, IV - the quotient groups of the lower central series. Ann. Math. 68(1), 81\u201395 (1958). \nhttps:\/\/doi.org\/10.2307\/1970044","journal-title":"Ann. Math."},{"key":"27_CR8","doi-asserted-by":"publisher","unstructured":"Clare, A., Daykin, J.W., Mills, T., Zarges, C.: Evolutionary search techniques for the Lyndon factorization of biosequences. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2019, Prague, Czech Republic, 13\u201317 July 2019, pp. 1543\u20131550. ACM (2019). \nhttps:\/\/doi.org\/10.1145\/3319619.3326872","DOI":"10.1145\/3319619.3326872"},{"key":"27_CR9","doi-asserted-by":"publisher","unstructured":"De Lucrezia, D., Slanzi, D., Poli, I., Polticelli, F., Minervini, G.: Do natural proteins differ from random sequences polypeptides? Natural vs. random proteins classification using an evolutionary neural network. PloS One 7(5), e36634\u2013e36634 (2012). \nhttps:\/\/doi.org\/10.1371\/journal.pone.0036634","DOI":"10.1371\/journal.pone.0036634"},{"issue":"16","key":"27_CR10","doi-asserted-by":"publisher","first-page":"2812","DOI":"10.1093\/bioinformatics\/bth335","volume":"20","author":"O Delgrange","year":"2004","unstructured":"Delgrange, O., Rivals, E.: STAR: an algorithm to search for tandem approximate repeats. Bioinform. (Oxford, Engl.) 20(16), 2812\u20132820 (2004). \nhttps:\/\/doi.org\/10.1093\/bioinformatics\/bth335","journal-title":"Bioinform. (Oxford, Engl.)"},{"issue":"4","key":"27_CR11","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(83)90017-2","volume":"4","author":"JP Duval","year":"1983","unstructured":"Duval, J.P.: Factorizing words over an ordered alphabet. J. Algorithms 4(4), 363\u2013381 (1983). \nhttps:\/\/doi.org\/10.1016\/0196-6774(83)90017-2","journal-title":"J. Algorithms"},{"key":"27_CR12","series-title":"Natural Computing Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44874-8","volume-title":"Introduction to Evolutionary Computing","author":"AE Eiben","year":"2015","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. NCS, 2nd edn. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-44874-8","edition":"2"},{"issue":"4598","key":"27_CR13","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"27_CR14","unstructured":"Kufleitner, M.: On bijective variants of the Burrows-Wheeler Transform. In: Holub, J., Zd\u00e1rek, J. (eds.) Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, pp. 65\u201379 (2009)"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1038\/nmeth.1923","volume":"9","author":"B Langmead","year":"2012","unstructured":"Langmead, B., Salzberg, S.L.: Fast gapped-read alignment with Bowtie 2. Nat. Methods 9, 357\u2013359 (2012). \nhttps:\/\/doi.org\/10.1038\/nmeth.1923","journal-title":"Nat. Methods"},{"issue":"14","key":"27_CR16","doi-asserted-by":"publisher","first-page":"1754","DOI":"10.1093\/bioinformatics\/btp324","volume":"25","author":"H Li","year":"2009","unstructured":"Li, H., Durbin, R.: Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics 25(14), 1754\u20131760 (2009). \nhttps:\/\/doi.org\/10.1093\/bioinformatics\/btp324","journal-title":"Bioinformatics"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.jda.2014.06.001","volume":"28","author":"S Mantaci","year":"2014","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: Suffix array and Lyndon factorization of a text. J. Discret. Algorithms 28, 2\u20138 (2014)","journal-title":"J. Discret. Algorithms"},{"issue":"253","key":"27_CR18","doi-asserted-by":"publisher","first-page":"68","DOI":"10.2307\/2280095","volume":"46","author":"FJ Massey","year":"1951","unstructured":"Massey, F.J.: The Kolmogorov-Smirnov test for goodness of fit. J. Am. Stat. Assoc. 46(253), 68\u201378 (1951). \nhttps:\/\/doi.org\/10.2307\/2280095","journal-title":"J. Am. Stat. Assoc."},{"issue":"D1","key":"27_CR19","doi-asserted-by":"publisher","first-page":"D733","DOI":"10.1093\/nar\/gkv1189","volume":"44","author":"NA O\u2019Leary","year":"2016","unstructured":"O\u2019Leary, N.A., et al.: Reference sequence (RefSeq) database at NCBI: current status, taxonomic expansion, and functional annotation. Nucleic Acids Res. 44(D1), D733\u2013D745 (2016). \nhttps:\/\/doi.org\/10.1093\/nar\/gkv1189","journal-title":"Nucleic Acids Res."},{"key":"27_CR20","unstructured":"Seward, J.: bzip2 and libbzip2 (1996). \nhttp:\/\/sourceware.org\/bzip2\/"},{"key":"27_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-319-99253-2_8","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"R Tin\u00f3s","year":"2018","unstructured":"Tin\u00f3s, R., Helsgaun, K., Whitley, D.: Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11101, pp. 95\u2013107. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-99253-2_8"},{"key":"27_CR22","unstructured":"Whitley, D.: Permutations. In: B\u00e4ck, T., Fogel, D.B., Michalewicz, Z. (eds.) Handbook of Evolutionary Computation, p. C1.4. IOP Publishing and Oxford University Press (1997)"},{"issue":"15","key":"27_CR23","doi-asserted-by":"publisher","first-page":"2949","DOI":"10.1007\/s00018-016-2138-9","volume":"73","author":"J-F Yu","year":"2016","unstructured":"Yu, J.-F., et al.: Natural protein sequences are more intrinsically disordered than random sequences. Cell. Mol. Life Sci. 73(15), 2949\u20132957 (2016). \nhttps:\/\/doi.org\/10.1007\/s00018-016-2138-9","journal-title":"Cell. Mol. Life Sci."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58112-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T16:17:54Z","timestamp":1599063474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58112-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581114","9783030581121"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58112-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"31 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"268","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"99","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}