{"id":"https://openalex.org/W6929216705","doi":"https://doi.org/10.4230/lipics.wabi.2025.21","title":"Linear-Space Subquadratic-Time String Alignment Algorithm for Arbitrary Scoring Matrices","display_name":"Linear-Space Subquadratic-Time String Alignment Algorithm for Arbitrary Scoring Matrices","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W6929216705","doi":"https://doi.org/10.4230/lipics.wabi.2025.21"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23947","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2025.21","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol344-wabi2025/LIPIcs.WABI.2025.21/LIPIcs.WABI.2025.21.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol344-wabi2025/LIPIcs.WABI.2025.21/LIPIcs.WABI.2025.21.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Yamano, Ryosuke","orcid":"https://orcid.org/0009-0002-1683-5179"},"institutions":[{"id":"https://openalex.org/I4210098918","display_name":"Tokyo Metropolitan Institute of Medical Science","ror":"https://ror.org/00vya8493","country_code":"JP","type":"facility","lineage":["https://openalex.org/I4210098918"]},{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yamano, Ryosuke","raw_affiliation_strings":["Division of Medical Data Informatics, Human Genome Center, Institute of Medical Science, The University of Tokyo, Japan","Department of Computer Science, Graduate School of Information Science and Technology, The University of Tokyo, Japan"],"raw_orcid":"https://orcid.org/0009-0002-1683-5179","affiliations":[{"raw_affiliation_string":"Division of Medical Data Informatics, Human Genome Center, Institute of Medical Science, The University of Tokyo, Japan","institution_ids":["https://openalex.org/I4210098918"]},{"raw_affiliation_string":"Department of Computer Science, Graduate School of Information Science and Technology, The University of Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]},{"author_position":"last","author":{"id":null,"display_name":"Shibuya, Tetsuo","orcid":"https://orcid.org/0000-0003-1514-5766"},"institutions":[{"id":"https://openalex.org/I4210098918","display_name":"Tokyo Metropolitan Institute of Medical Science","ror":"https://ror.org/00vya8493","country_code":"JP","type":"facility","lineage":["https://openalex.org/I4210098918"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Shibuya, Tetsuo","raw_affiliation_strings":["Division of Medical Data Informatics, Human Genome Center, Institute of Medical Science, The University of Tokyo, Japan"],"raw_orcid":"https://orcid.org/0000-0003-1514-5766","affiliations":[{"raw_affiliation_string":"Division of Medical Data Informatics, Human Genome Center, Institute of Medical Science, The University of Tokyo, Japan","institution_ids":["https://openalex.org/I4210098918"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22005583,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.8136000037193298,"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.8136000037193298,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.02419999986886978,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T11567","display_name":"semigroups and automata theory","score":0.01899999938905239,"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/string","display_name":"String (physics)","score":0.5354999899864197},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5236999988555908},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4925999939441681},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.47130000591278076},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.4560999870300293},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.45579999685287476},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4544000029563904},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41110000014305115}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7075999975204468},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5354999899864197},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5236999988555908},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4925999939441681},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.475600004196167},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.47130000591278076},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.4560999870300293},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.45579999685287476},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4544000029563904},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.453900009393692},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41110000014305115},{"id":"https://openalex.org/C32610155","wikidata":"https://www.wikidata.org/wiki/Q1798621","display_name":"Approximate string matching","level":3,"score":0.35260000824928284},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.35260000824928284},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.34599998593330383},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.32429999113082886},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.30329999327659607},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.29510000348091125},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.2919999957084656},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2718000113964081},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.26669999957084656},{"id":"https://openalex.org/C130187892","wikidata":"https://www.wikidata.org/wiki/Q133327","display_name":"Spacetime","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C75930677","wikidata":"https://www.wikidata.org/wiki/Q1251950","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","level":3,"score":0.2567000091075897},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.2547999918460846}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:23947","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2025.21","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol344-wabi2025/LIPIcs.WABI.2025.21/LIPIcs.WABI.2025.21.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.wabi.2025.21","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.wabi.2025.21","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23947","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2025.21","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol344-wabi2025/LIPIcs.WABI.2025.21/LIPIcs.WABI.2025.21.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2879543046","display_name":null,"funder_award_id":"21H05052","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G5850052687","display_name":null,"funder_award_id":"23K18501","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320320912","display_name":"Ministry of Education, Culture, Sports, Science and Technology","ror":"https://ror.org/048rj2z13"},{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6929216705.pdf","grobid_xml":"https://content.openalex.org/works/W6929216705.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Theoretically,":[0],"the":[1,10,34,42,47,70,74,111,115,123,131,154,160,173],"fastest":[2],"algorithm":[3,28,52,63,99,118,132,182],"by":[4,94,108],"Crochemore":[5,134],"et":[6,135],"al.":[7,136],"for":[8,82],"computing":[9,152],"alignment":[11,155,192],"of":[12,16,58,114,133,162],"two":[13],"given":[14],"strings":[15],"size":[17],"n":[18],"over":[19],"a":[20,89],"constant":[21],"alphabet":[22],"takes":[23,64],"O(n\u00b2/log":[24,65,102],"n)":[25,66,103,148,177],"time.":[26,104,125],"The":[27,105],"uses":[29],"Lempel\u2013Ziv":[30],"parsing":[31],"to":[32,91,119,130,186],"divide":[33],"dynamic":[35],"programming":[36],"matrix":[37],"into":[38],"blocks":[39],"and":[40,68,189],"utilizes":[41],"repetitive":[43],"structure.":[44],"It":[45],"is":[46],"only":[48,153],"previously":[49],"known":[50],"subquadratic-time":[51],"that":[53,100],"can":[54,183],"handle":[55],"scoring":[56],"matrices":[57],"arbitrary":[59],"weights.":[60],"However,":[61,126],"this":[62,92,128],"space,":[67],"reducing":[69],"space":[71,98,112,149,170],"while":[72,121,171],"preserving":[73,122,172],"time":[75,179],"complexity":[76,113],"has":[77,137],"been":[78,138],"an":[79,96],"open":[80],"problem":[81],"more":[83],"than":[84],"20":[85],"years.":[86],"We":[87],"present":[88],"solution":[90],"issue":[93],"achieving":[95],"O(n)":[97,120,169],"maintains":[101],"classical":[106],"refinement":[107],"Hirschberg":[109],"reduces":[110],"textbook":[116],"O(n\u00b2)":[117],"quadratic":[124],"applying":[127],"technique":[129],"considered":[139],"challenging":[140],"because":[141],"their":[142],"method":[143],"requires":[144],"O(n\u00b2":[145,174],"/":[146,175],"log":[147,176],"even":[150],"when":[151],"score.":[156],"Our":[157,181],"modification":[158],"enables":[159],"application":[161],"Hirschberg\u2019s":[163],"refinement,":[164],"allowing":[165],"traceback":[166],"computation":[167],"in":[168],"overall":[178],"complexity.":[180],"be":[184],"applied":[185],"both":[187],"global":[188],"local":[190],"string":[191],"problems.":[193]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}