{"id":"https://openalex.org/W4396227784","doi":"https://doi.org/10.1186/s13015-024-00262-6","title":"Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants","display_name":"Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants","publication_year":2024,"publication_date":"2024-04-29","ids":{"openalex":"https://openalex.org/W4396227784","doi":"https://doi.org/10.1186/s13015-024-00262-6","pmid":"https://pubmed.ncbi.nlm.nih.gov/38679703"},"language":"en","primary_location":{"id":"doi:10.1186/s13015-024-00262-6","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1186/s13015-024-00262-6","pdf_url":"https://link.springer.com/content/pdf/10.1186/s13015-024-00262-6.pdf","source":{"id":"https://openalex.org/S205663195","display_name":"Algorithms for Molecular Biology","issn_l":"1748-7188","issn":["1748-7188"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320256","host_organization_name":"BioMed Central","host_organization_lineage":["https://openalex.org/P4310320256","https://openalex.org/P4310319965"],"host_organization_lineage_names":["BioMed Central","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for Molecular Biology","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj","pubmed"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://link.springer.com/content/pdf/10.1186/s13015-024-00262-6.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063377635","display_name":"Yutong Qiu","orcid":"https://orcid.org/0000-0001-6058-1212"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yutong Qiu","raw_affiliation_strings":["Ray and Stephanie Lane Computational Biology Department, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, 15213, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ray and Stephanie Lane Computational Biology Department, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, 15213, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083540149","display_name":"Yihang Shen","orcid":"https://orcid.org/0000-0002-6161-3906"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yihang Shen","raw_affiliation_strings":["Ray and Stephanie Lane Computational Biology Department, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, 15213, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ray and Stephanie Lane Computational Biology Department, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, 15213, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113653378","display_name":"Carl Kingsford","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Carl Kingsford","raw_affiliation_strings":["Ray and Stephanie Lane Computational Biology Department, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, 15213, PA, USA. carlk@cs.cmu.edu","Ray and Stephanie Lane Computational Biology Department, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, 15213, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ray and Stephanie Lane Computational Biology Department, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, 15213, PA, USA. carlk@cs.cmu.edu","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Ray and Stephanie Lane Computational Biology Department, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, 15213, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5113653378"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":{"value":2290,"currency":"USD","value_usd":2290},"apc_paid":{"value":2290,"currency":"USD","value_usd":2290},"fwci":0.1643,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.46777609,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"19","issue":"1","first_page":"17","last_page":"17"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9995999932289124,"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/T10434","display_name":"Chromosomal and Genetic Variations","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9940000176429749,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.7234224081039429},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6166799664497375},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.610397219657898},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6090610027313232},{"id":"https://openalex.org/keywords/eulerian-path","display_name":"Eulerian path","score":0.5764644145965576},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.523350179195404},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5143452882766724},{"id":"https://openalex.org/keywords/de-bruijn-graph","display_name":"De Bruijn graph","score":0.4663279354572296},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.4436679780483246},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4423871338367462},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.440705269575119},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4158353805541992},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39523014426231384},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37395018339157104},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32259082794189453},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30084389448165894}],"concepts":[{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.7234224081039429},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6166799664497375},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.610397219657898},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6090610027313232},{"id":"https://openalex.org/C43058520","wikidata":"https://www.wikidata.org/wiki/Q624580","display_name":"Eulerian path","level":3,"score":0.5764644145965576},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.523350179195404},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5143452882766724},{"id":"https://openalex.org/C20218877","wikidata":"https://www.wikidata.org/wiki/Q3066095","display_name":"De Bruijn graph","level":3,"score":0.4663279354572296},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.4436679780483246},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4423871338367462},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.440705269575119},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4158353805541992},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39523014426231384},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37395018339157104},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32259082794189453},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30084389448165894},{"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/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1186/s13015-024-00262-6","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1186/s13015-024-00262-6","pdf_url":"https://link.springer.com/content/pdf/10.1186/s13015-024-00262-6.pdf","source":{"id":"https://openalex.org/S205663195","display_name":"Algorithms for Molecular Biology","issn_l":"1748-7188","issn":["1748-7188"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320256","host_organization_name":"BioMed Central","host_organization_lineage":["https://openalex.org/P4310320256","https://openalex.org/P4310319965"],"host_organization_lineage_names":["BioMed Central","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for Molecular Biology","raw_type":"journal-article"},{"id":"pmid:38679703","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/38679703","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for molecular biology : AMB","raw_type":null},{"id":"pmh:oai:pubmedcentral.nih.gov:11056321","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/11056321","pdf_url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC11056321/pdf/13015_2024_Article_262.pdf","source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"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":"Algorithms Mol Biol","raw_type":"Text"},{"id":"pmh:oai:doaj.org/article:8be5fffc7ce74715b158837f4477ac5f","is_oa":false,"landing_page_url":"https://doaj.org/article/8be5fffc7ce74715b158837f4477ac5f","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms for Molecular Biology, Vol 19, Iss 1, Pp 1-24 (2024)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1186/s13015-024-00262-6","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1186/s13015-024-00262-6","pdf_url":"https://link.springer.com/content/pdf/10.1186/s13015-024-00262-6.pdf","source":{"id":"https://openalex.org/S205663195","display_name":"Algorithms for Molecular Biology","issn_l":"1748-7188","issn":["1748-7188"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320256","host_organization_name":"BioMed Central","host_organization_lineage":["https://openalex.org/P4310320256","https://openalex.org/P4310319965"],"host_organization_lineage_names":["BioMed Central","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for Molecular Biology","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5099999904632568,"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land"}],"awards":[{"id":"https://openalex.org/G1310392732","display_name":null,"funder_award_id":"DBI-1937540","funder_id":"https://openalex.org/F4320332161","funder_display_name":"National Institutes of Health"},{"id":"https://openalex.org/G3584959149","display_name":null,"funder_award_id":"R01 HG012470","funder_id":"https://openalex.org/F4320337348","funder_display_name":"National Human Genome Research Institute"},{"id":"https://openalex.org/G3788099519","display_name":null,"funder_award_id":"R01HG012470","funder_id":"https://openalex.org/F4320332161","funder_display_name":"National Institutes of Health"},{"id":"https://openalex.org/G3858817854","display_name":null,"funder_award_id":"III-2232121","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6667550415","display_name":"IIBR:Informatics:Toward an Automated RNA-seq Bioinformatician","funder_award_id":"1937540","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7686337660","display_name":null,"funder_award_id":"DBI-1937540","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8144893449","display_name":"III:Small: Expressiveness of Genome Graphs: Construction, Comparison, and Heterogeneity","funder_award_id":"2232121","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332161","display_name":"National Institutes of Health","ror":"https://ror.org/01cwqze88"},{"id":"https://openalex.org/F4320337348","display_name":"National Human Genome Research Institute","ror":"https://ror.org/00baak391"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4396227784.pdf","grobid_xml":"https://content.openalex.org/works/W4396227784.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1496383623","https://openalex.org/W1559169059","https://openalex.org/W1971926406","https://openalex.org/W1977545325","https://openalex.org/W1993601594","https://openalex.org/W2029958010","https://openalex.org/W2049287714","https://openalex.org/W2074231493","https://openalex.org/W2136651963","https://openalex.org/W2143668817","https://openalex.org/W2180048932","https://openalex.org/W2557731459","https://openalex.org/W2978396589","https://openalex.org/W3004584205","https://openalex.org/W3005928777","https://openalex.org/W3033322505","https://openalex.org/W4206067192","https://openalex.org/W4213060235","https://openalex.org/W4213255380","https://openalex.org/W4225379371","https://openalex.org/W4226340209","https://openalex.org/W4306803826","https://openalex.org/W6601640946"],"related_works":["https://openalex.org/W2200188075","https://openalex.org/W4252596799","https://openalex.org/W4254594467","https://openalex.org/W4230405657","https://openalex.org/W244044452","https://openalex.org/W2552915643","https://openalex.org/W170547082","https://openalex.org/W3213135344","https://openalex.org/W3183956626","https://openalex.org/W2136735429"],"abstract_inverted_index":{"The":[0,93,189],"graph":[1],"traversal":[2],"edit":[3,22],"distance":[4,16,23],"(GTED),":[5],"introduced":[6],"by":[7,44,118,130],"Ebrahimpour":[8,60,131],"Boroojeny":[9,61,132],"et":[10,62,133],"al.":[11,63,134],"(2018),":[12],"is":[13,75,97,100,122,196],"an":[14],"elegant":[15],"measure":[17],"defined":[18],"as":[19],"the":[20,51,79,86,103,127,159,185],"minimum":[21],"between":[24,42],"strings":[25],"reconstructed":[26],"from":[27],"Eulerian":[28],"trails":[29],"in":[30,115,152],"two":[31,66],"edge-labeled":[32],"graphs.":[33],"GTED":[34,70,74,96,121,138,147,166],"can":[35],"be":[36],"used":[37],"to":[38,102,184,192],"infer":[39],"evolutionary":[40],"relationships":[41],"species":[43],"comparing":[45,179],"de":[46],"Bruijn":[47],"graphs":[48,181],"directly":[49],"without":[50],"computationally":[52],"costly":[53],"and":[54,71,124,148,167,182],"error-prone":[55],"process":[56],"of":[57,83,85,106,146,165,187],"genome":[58,180],"assembly.":[59],"(2018)":[64],"propose":[65],"ILP":[67,163],"formulations":[68,164],"for":[69,142,178],"claim":[72,94],"that":[73,95,120,126],"polynomially":[76,98],"solvable":[77,99,151],"because":[78],"linear":[80],"programming":[81],"relaxation":[82],"one":[84],"ILPs":[87,128],"always":[88],"yields":[89],"optimal":[90],"integer":[91],"solutions.":[92],"contradictory":[101],"complexity":[104,116],"results":[105,117,173,195],"existing":[107],"string-to-graph":[108],"matching":[109],"problems.":[110],"We":[111],"resolve":[112],"this":[113],"conflict":[114],"proving":[119],"NP-complete":[123],"showing":[125],"proposed":[129],"do":[135],"not":[136,150],"solve":[137,141],"but":[139],"instead":[140],"a":[143],"lower":[144],"bound":[145],"are":[149],"polynomial":[153],"time.":[154],"In":[155],"addition,":[156],"we":[157],"provide":[158,174],"first":[160],"two,":[161],"correct":[162],"evaluate":[168],"their":[169],"empirical":[170],"efficiency.":[171],"These":[172],"solid":[175],"algorithmic":[176],"foundations":[177],"point":[183],"direction":[186],"heuristics.":[188],"source":[190],"code":[191],"reproduce":[193],"experimental":[194],"available":[197],"at":[198],"https://github.com/Kingsford-Group/gtednewilp/":[199],".":[200]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}