{"id":"https://openalex.org/W135432428","doi":"https://doi.org/10.25596/jalc-2005-609","title":"Approximate Seeds of Strings","display_name":"Approximate Seeds of Strings","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W135432428","doi":"https://doi.org/10.25596/jalc-2005-609","mag":"135432428"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.386.3874","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.386.3874","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcs.kcl.ac.uk/staff/csi/publications/CIP03ApproxSeeds.pdf","raw_type":"text"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://doi.org/10.25596/jalc-2005-609","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019614428","display_name":"Manolis Christodoulakis","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christodoulakis, Manolis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058155947","display_name":"Costas S. Iliopoulos","orcid":"https://orcid.org/0000-0003-3909-0077"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Iliopoulos, Costas S.","raw_affiliation_strings":["Informatics"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Informatics","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039462502","display_name":"Kunsoo Park","orcid":"https://orcid.org/0000-0001-5225-0907"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Park, Kunsoo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5025061145","display_name":"Jeong Seop Sim","orcid":"https://orcid.org/0000-0002-6609-8384"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sim, Jeong Seop","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5756,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.86429839,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"10","issue":null,"first_page":"609","last_page":"626"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9919999837875366,"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":0.9919999837875366,"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/T12029","display_name":"DNA and Biological Computing","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9739999771118164,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/substring","display_name":"Substring","score":0.8921011090278625},{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.8608802556991577},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.7814037799835205},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6440331935882568},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5658186674118042},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5431186556816101},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5367336273193359},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.4816219210624695},{"id":"https://openalex.org/keywords/approximate-string-matching","display_name":"Approximate string matching","score":0.46063458919525146},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.43838435411453247},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38615721464157104},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34178224205970764},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3262590765953064},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.2372470200061798},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16415300965309143},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.14829960465431213}],"concepts":[{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.8921011090278625},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.8608802556991577},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.7814037799835205},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6440331935882568},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5658186674118042},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5431186556816101},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5367336273193359},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.4816219210624695},{"id":"https://openalex.org/C32610155","wikidata":"https://www.wikidata.org/wiki/Q1798621","display_name":"Approximate string matching","level":3,"score":0.46063458919525146},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.43838435411453247},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38615721464157104},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34178224205970764},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3262590765953064},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.2372470200061798},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16415300965309143},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.14829960465431213},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"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/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.386.3874","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.386.3874","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcs.kcl.ac.uk/staff/csi/publications/CIP03ApproxSeeds.pdf","raw_type":"text"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/8845cd71-add9-420b-bf0d-d6739c072de9","is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/8845cd71-add9-420b-bf0d-d6739c072de9","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Christodoulakis, M, Iliopoulos, C S, Park, K & Sim, J S 2005, 'Approximate Seeds of Strings', Journal of Automata, Languages and Combinatorics, vol. 10, no. 5/6, N/A, pp. 609-626.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.25596/jalc-2005-609","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2005-609","pdf_url":null,"source":{"id":"https://openalex.org/S62907800","display_name":"Journal of automata, languages and combinatorics","issn_l":"1430-189X","issn":["1430-189X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310313929","host_organization_name":"University of Giessen","host_organization_lineage":["https://openalex.org/P4310313929"],"host_organization_lineage_names":["University of Giessen"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:268246673","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.25596/jalc-2005-609","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2005-609","pdf_url":null,"source":{"id":"https://openalex.org/S62907800","display_name":"Journal of automata, languages and combinatorics","issn_l":"1430-189X","issn":["1430-189X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310313929","host_organization_name":"University of Giessen","host_organization_lineage":["https://openalex.org/P4310313929"],"host_organization_lineage_names":["University of Giessen"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W63662079","https://openalex.org/W2056972845","https://openalex.org/W2730234337","https://openalex.org/W2084345246","https://openalex.org/W1995705893","https://openalex.org/W1981523680","https://openalex.org/W2056819372","https://openalex.org/W2088906714","https://openalex.org/W2121328026","https://openalex.org/W1515213620","https://openalex.org/W2083687743","https://openalex.org/W1971349783","https://openalex.org/W2911636427","https://openalex.org/W346561848","https://openalex.org/W2043481183","https://openalex.org/W2952544458","https://openalex.org/W2938635738","https://openalex.org/W2133601898","https://openalex.org/W1979205601","https://openalex.org/W1504417041"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,63],"study":[4],"approximate":[5,49,56,69],"seeds":[6],"of":[7,12,25,30],"strings,":[8],"that":[9,17,65],"is,":[10],"substrings":[11],"a":[13,23,28],"given":[14],"string":[15],"x":[16],"cover":[18],"(by":[19],"concatenations":[20],"or":[21],"overlaps)":[22],"superstring":[24],"$x$,":[26],"under":[27],"variety":[29],"distance":[31,48],"rules":[32],"(the":[33],"Hamming":[34],"distance,":[35,38],"the":[36,40,46,53,66],"edit":[37,42],"and":[39,52,62],"weighted":[41],"distance).":[43],"We":[44],"solve":[45],"smallest":[47,55,68],"seed":[50,57,70],"problem":[51,58,71],"restricted":[54],"in":[59],"polynomial":[60],"time":[61],"prove":[64],"general":[67],"is":[72],"NP-complete.":[73]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}