{"id":"https://openalex.org/W2036565612","doi":"https://doi.org/10.1109/isda.2011.6121705","title":"Optimizing alphabet using genetic algorithms","display_name":"Optimizing alphabet using genetic algorithms","publication_year":2011,"publication_date":"2011-11-01","ids":{"openalex":"https://openalex.org/W2036565612","doi":"https://doi.org/10.1109/isda.2011.6121705","mag":"2036565612"},"language":"en","primary_location":{"id":"doi:10.1109/isda.2011.6121705","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isda.2011.6121705","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 11th International Conference on Intelligent Systems Design and Applications","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038161265","display_name":"Jan Plato\u0161","orcid":"https://orcid.org/0000-0002-8481-0136"},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Jan Platos","raw_affiliation_strings":["Department of Computer Science, FEECS, VSB-Technical University of Ostrava, Ostrava Poruba, Czech Republic","Department of Computer Science, FEECS, VSB-Technical University of Ostrava, 17. listopadu 15, 708 00, Ostrava Poruba, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, FEECS, VSB-Technical University of Ostrava, Ostrava Poruba, Czech Republic","institution_ids":["https://openalex.org/I142208455"]},{"raw_affiliation_string":"Department of Computer Science, FEECS, VSB-Technical University of Ostrava, 17. listopadu 15, 708 00, Ostrava Poruba, Czech Republic","institution_ids":["https://openalex.org/I142208455"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088934266","display_name":"Pavel Kr\u00f6mer","orcid":"https://orcid.org/0000-0001-8428-3332"},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Pavel Kromer","raw_affiliation_strings":["Department of Computer Science, FEECS, VSB-Technical University of Ostrava, Ostrava Poruba, Czech Republic","Department of Computer Science, FEECS, VSB-Technical University of Ostrava, 17. listopadu 15, 708 00, Ostrava Poruba, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, FEECS, VSB-Technical University of Ostrava, Ostrava Poruba, Czech Republic","institution_ids":["https://openalex.org/I142208455"]},{"raw_affiliation_string":"Department of Computer Science, FEECS, VSB-Technical University of Ostrava, 17. listopadu 15, 708 00, Ostrava Poruba, Czech Republic","institution_ids":["https://openalex.org/I142208455"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038161265"],"corresponding_institution_ids":["https://openalex.org/I142208455"],"apc_list":null,"apc_paid":null,"fwci":1.7103,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.86351068,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"129","issue":null,"first_page":"498","last_page":"503"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/symbol","display_name":"Symbol (formal)","score":0.7833210229873657},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6871616840362549},{"id":"https://openalex.org/keywords/ascii","display_name":"ASCII","score":0.6713643074035645},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6090205907821655},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.6059491038322449},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.6057960987091064},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.6046697497367859},{"id":"https://openalex.org/keywords/character","display_name":"Character (mathematics)","score":0.5930827856063843},{"id":"https://openalex.org/keywords/syllable","display_name":"Syllable","score":0.5739526748657227},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5449139475822449},{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.5140329599380493},{"id":"https://openalex.org/keywords/compression","display_name":"Compression (physics)","score":0.4841538071632385},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4814445376396179},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.4367269277572632},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3635323643684387},{"id":"https://openalex.org/keywords/speech-recognition","display_name":"Speech recognition","score":0.24304631352424622},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23595187067985535},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.07919329404830933}],"concepts":[{"id":"https://openalex.org/C134400042","wikidata":"https://www.wikidata.org/wiki/Q2372244","display_name":"Symbol (formal)","level":2,"score":0.7833210229873657},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6871616840362549},{"id":"https://openalex.org/C196832560","wikidata":"https://www.wikidata.org/wiki/Q8815","display_name":"ASCII","level":2,"score":0.6713643074035645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6090205907821655},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.6059491038322449},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.6057960987091064},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.6046697497367859},{"id":"https://openalex.org/C2780861071","wikidata":"https://www.wikidata.org/wiki/Q1062934","display_name":"Character (mathematics)","level":2,"score":0.5930827856063843},{"id":"https://openalex.org/C109089402","wikidata":"https://www.wikidata.org/wiki/Q8188","display_name":"Syllable","level":2,"score":0.5739526748657227},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5449139475822449},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.5140329599380493},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.4841538071632385},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4814445376396179},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.4367269277572632},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3635323643684387},{"id":"https://openalex.org/C28490314","wikidata":"https://www.wikidata.org/wiki/Q189436","display_name":"Speech recognition","level":1,"score":0.24304631352424622},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23595187067985535},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.07919329404830933},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isda.2011.6121705","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isda.2011.6121705","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 11th International Conference on Intelligent Systems Design and Applications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6499999761581421,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W50400872","https://openalex.org/W106890533","https://openalex.org/W158805393","https://openalex.org/W1513108299","https://openalex.org/W1514528578","https://openalex.org/W1884067694","https://openalex.org/W1975965284","https://openalex.org/W1990653637","https://openalex.org/W1995875735","https://openalex.org/W2019298113","https://openalex.org/W2024749224","https://openalex.org/W2046419776","https://openalex.org/W2060108852","https://openalex.org/W2079145130","https://openalex.org/W2097571405","https://openalex.org/W2103270527","https://openalex.org/W2107745473","https://openalex.org/W2119878143","https://openalex.org/W2122962290","https://openalex.org/W2135771747","https://openalex.org/W2138523425","https://openalex.org/W2155729921","https://openalex.org/W2160484851","https://openalex.org/W2161488606","https://openalex.org/W2161628678","https://openalex.org/W2169469805","https://openalex.org/W2911940095","https://openalex.org/W4230511558","https://openalex.org/W6602111405","https://openalex.org/W6604271790","https://openalex.org/W6630778951","https://openalex.org/W6630794632","https://openalex.org/W6683504902"],"related_works":["https://openalex.org/W629813691","https://openalex.org/W1642511318","https://openalex.org/W922862503","https://openalex.org/W2048356074","https://openalex.org/W2941649707","https://openalex.org/W1524330646","https://openalex.org/W3125143615","https://openalex.org/W3121534999","https://openalex.org/W2170260520","https://openalex.org/W2012669748"],"abstract_inverted_index":{"Data":[0],"compression":[1,54],"algorithms":[2,17],"were":[3,44],"usually":[4,19],"designed":[5],"for":[6,113,117],"data":[7],"processing":[8],"symbol":[9],"by":[10,38],"symbol.":[11],"The":[12,121],"input":[13,30],"symbols":[14,34,100],"of":[15,28,104],"these":[16],"are":[18,36,68],"taken":[20],"from":[21],"the":[22,26,29,49,114],"ASCII":[23],"table,":[24],"i.e.":[25],"size":[27],"alphabet":[31,116,122],"is":[32,74],"256":[33],"which":[35,47,59],"representable":[37],"8-bit":[39],"numbers.":[40],"Several":[41],"other":[42],"techniques":[43],"developed-syllable-based":[45],"compression,":[46,58],"uses":[48,60],"syllable":[50],"as":[51,62,101],"a":[52,79,94,98,102],"basic":[53,63],"symbol,":[55],"and":[56,71,92,126],"word-based":[57],"words":[61],"symbols.":[64],"These":[65],"three":[66],"approaches":[67],"strictly":[69],"bounded":[70],"no":[72],"overlap":[73,89],"allowed.":[75],"This":[76,106],"may":[77,83,123],"be":[78,84],"problem":[80],"because":[81],"it":[82],"helpful":[85],"to":[86],"have":[87],"an":[88,109],"between":[90],"them":[91],"use":[93],"character-based":[95],"approach":[96],"with":[97],"few":[99],"sequence":[103],"characters.":[105],"paper":[107],"describes":[108],"algorithm":[110],"that":[111],"looks":[112],"optimal":[115],"different":[118],"text":[119],"files.":[120],"contain":[124],"characters":[125],"2-grams.":[127]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}