{"id":"https://openalex.org/W4387457819","doi":"https://doi.org/10.1134/s0361768823050031","title":"Twenty Similarity Functions for Two Finite Sequences","display_name":"Twenty Similarity Functions for Two Finite Sequences","publication_year":2023,"publication_date":"2023-10-01","ids":{"openalex":"https://openalex.org/W4387457819","doi":"https://doi.org/10.1134/s0361768823050031"},"language":"en","primary_location":{"id":"doi:10.1134/s0361768823050031","is_oa":false,"landing_page_url":"https://doi.org/10.1134/s0361768823050031","pdf_url":null,"source":{"id":"https://openalex.org/S150218641","display_name":"Programming and Computer Software","issn_l":"0361-7688","issn":["0361-7688","1608-3261"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Programming and Computer Software","raw_type":"journal-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/A5112413570","display_name":"Igor Burdonov","orcid":null},"institutions":[{"id":"https://openalex.org/I4210101868","display_name":"Institute for System Programming","ror":"https://ror.org/017ef8252","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210101868","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"I. Burdonov","raw_affiliation_strings":["Ivannikov Institute for System Programming, Russian Academy of Sciences, ul. Solzhenitsyna 25, 109004, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Ivannikov Institute for System Programming, Russian Academy of Sciences, ul. Solzhenitsyna 25, 109004, Moscow, Russia","institution_ids":["https://openalex.org/I4210101868"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029171784","display_name":"Anatolii G. Maksimov","orcid":"https://orcid.org/0000-0002-7542-3302"},"institutions":[{"id":"https://openalex.org/I4210101868","display_name":"Institute for System Programming","ror":"https://ror.org/017ef8252","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210101868","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"A. Maksimov","raw_affiliation_strings":["Ivannikov Institute for System Programming, Russian Academy of Sciences, ul. Solzhenitsyna 25, 109004, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Ivannikov Institute for System Programming, Russian Academy of Sciences, ul. Solzhenitsyna 25, 109004, Moscow, Russia","institution_ids":["https://openalex.org/I4210101868"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5112413570"],"corresponding_institution_ids":["https://openalex.org/I4210101868"],"apc_list":null,"apc_paid":null,"fwci":0.3491,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65957218,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"49","issue":"5","first_page":"373","last_page":"387"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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.9998999834060669,"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/T11130","display_name":"Coding theory and cryptography","score":0.9991999864578247,"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.994700014591217,"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/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.8359540700912476},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.7435977458953857},{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.7248489856719971},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.7099215984344482},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7019034624099731},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.648980975151062},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.600773811340332},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.595896303653717},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4927404224872589},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46085065603256226},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.4593828320503235},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.41232308745384216},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40484267473220825},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3657831847667694},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21981799602508545},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.10248097777366638},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0911514163017273},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.08385887742042542}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.8359540700912476},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.7435977458953857},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.7248489856719971},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.7099215984344482},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7019034624099731},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.648980975151062},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.600773811340332},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.595896303653717},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4927404224872589},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46085065603256226},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.4593828320503235},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.41232308745384216},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40484267473220825},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3657831847667694},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21981799602508545},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.10248097777366638},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0911514163017273},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.08385887742042542},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"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/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1134/s0361768823050031","is_oa":false,"landing_page_url":"https://doi.org/10.1134/s0361768823050031","pdf_url":null,"source":{"id":"https://openalex.org/S150218641","display_name":"Programming and Computer Software","issn_l":"0361-7688","issn":["0361-7688","1608-3261"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Programming and Computer Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1970026646","https://openalex.org/W2007300759","https://openalex.org/W2792356880","https://openalex.org/W4206410708"],"related_works":["https://openalex.org/W4225868058","https://openalex.org/W3022573534","https://openalex.org/W4385963882","https://openalex.org/W2152064395","https://openalex.org/W4289596129","https://openalex.org/W2520870971","https://openalex.org/W1540010783","https://openalex.org/W3083981518","https://openalex.org/W3094761360","https://openalex.org/W4385904708"],"abstract_inverted_index":{"This":[0,56],"paper":[1],"considers":[2],"various":[3],"numerical":[4,183],"functions":[5,119],"that":[6],"determine":[7],"the":[8,22,61,64,74,77,80,86,91,94,102,111,117,122,128,146,153,156,169,174],"degree":[9],"of":[10,24,35,50,60,63,71,76,93,124,130,132,134,148,150,155,159,161,187,194,203],"similarity":[11,17,170],"between":[12,47],"two":[13,104,200],"finite":[14],"sequences.":[15,55],"These":[16],"measures":[18],"are":[19,139,197,210],"based":[20,172],"on":[21,173],"concept":[23,62],"embedding":[25,37,107,164],"for":[26,185,199],"sequences,":[27,167],"which":[28],"we":[29,180,214],"define":[30],"here.":[31],"A":[32],"special":[33],"case":[34],"this":[36],"is":[38,57],"a":[39,51,58,137,162,207],"subsequence.":[40],"Other":[41],"cases":[42],"additionally":[43],"require":[44],"equal":[45],"distances":[46,72],"adjacent":[48],"symbols":[49],"subsequence":[52],"in":[53,110,136,165],"both":[54,166],"generalization":[59],"substring":[65],"with":[66,206],"unit":[67],"distances.":[68],"Moreover,":[69],"equality":[70],"from":[73,85],"beginning":[75],"sequences":[78,95],"to":[79,90,101],"first":[81],"embedded":[82,88],"symbol":[83,89],"or":[84,127],"last":[87,103],"end":[92],"may":[96],"be":[97],"required.":[98],"In":[99,116,178,212],"addition":[100],"cases,":[105],"an":[106],"can":[108],"occur":[109],"sequence":[112,138],"more":[113],"than":[114],"once.":[115],"literature,":[118],"such":[120],"as":[121],"number":[123,129],"common":[125,151,163,176],"embeddings":[126,135,218],"pairs":[131],"occurrences":[133,160],"used.":[140],"We":[141],"introduce":[142],"three":[143],"additional":[144],"functions:":[145],"sum":[147,154],"lengths":[149],"embeddings,":[152],"minimum":[157],"numbers":[158],"and":[168,219],"function":[171],"longest":[175],"embedding.":[177],"total,":[179],"consider":[181],"20":[182],"functions;":[184],"17":[186],"these":[188,217],"functions,":[189,201],"algorithms":[190,202],"(including":[191],"new":[192],"ones)":[193],"polynomial":[195],"complexity":[196,205],"proposed;":[198],"exponential":[204],"reduced":[208],"exponent":[209],"proposed.":[211],"Conclusions,":[213],"briefly":[215],"compare":[216],"functions.":[220]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-01-23T23:20:30.427331","created_date":"2025-10-10T00:00:00"}