{"id":"https://openalex.org/W7168975093","doi":"https://doi.org/10.1109/access.2026.3714091","title":"TIPE: A Bounded and Signature-Aware Framework for Path Construction in Genome Graphs","display_name":"TIPE: A Bounded and Signature-Aware Framework for Path Construction in Genome Graphs","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7168975093","doi":"https://doi.org/10.1109/access.2026.3714091"},"language":"en","primary_location":{"id":"doi:10.1109/access.2026.3714091","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3714091","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2026.3714091","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044868690","display_name":"Dimitris Kalatzis","orcid":"https://orcid.org/0000-0002-2186-4567"},"institutions":[{"id":"https://openalex.org/I200777214","display_name":"National and Kapodistrian University of Athens","ror":"https://ror.org/04gnjpq42","country_code":"GR","type":"education","lineage":["https://openalex.org/I200777214"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Dimitris Kalatzis","raw_affiliation_strings":["National and Kapodistrian University of Athens"],"raw_orcid":"https://orcid.org/0000-0002-2186-4567","affiliations":[{"raw_affiliation_string":"National and Kapodistrian University of Athens","institution_ids":["https://openalex.org/I200777214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044868690"],"corresponding_institution_ids":["https://openalex.org/I200777214"],"apc_list":{"value":2075,"currency":"USD","value_usd":2075},"apc_paid":{"value":2075,"currency":"USD","value_usd":2075},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.75649291,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":null,"first_page":"108558","last_page":"108570"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.4844000041484833,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.4844000041484833,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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/T10887","display_name":"Bioinformatics and Genomic Networks","score":0.21040000021457672,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.05700000002980232,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/bounded-function","display_name":"Bounded function","score":0.6524999737739563},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5378999710083008},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.3580000102519989},{"id":"https://openalex.org/keywords/genome","display_name":"Genome","score":0.2831000089645386},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.28040000796318054},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.27459999918937683}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6524999737739563},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6086999773979187},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5378999710083008},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46869999170303345},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4205000102519989},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4099000096321106},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3580000102519989},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3248000144958496},{"id":"https://openalex.org/C141231307","wikidata":"https://www.wikidata.org/wiki/Q7020","display_name":"Genome","level":3,"score":0.2831000089645386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28049999475479126},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.28040000796318054},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.27459999918937683},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.2736999988555908},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.2603999972343445},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C3020028006","wikidata":"https://www.wikidata.org/wiki/Q9158","display_name":"Electronic mail","level":2,"score":0.25040000677108765}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2026.3714091","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3714091","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:9513607950b34b99af50dcc72bc9be9e","is_oa":false,"landing_page_url":"https://doaj.org/article/9513607950b34b99af50dcc72bc9be9e","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":"IEEE Access, Vol 14, Pp 108558-108570 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2026.3714091","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3714091","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Graph-based":[0],"representations":[1],"are":[2],"increasingly":[3],"used":[4],"to":[5,29,148,202],"model":[6],"genomic":[7],"variation,":[8],"enabling":[9],"richer":[10],"descriptions":[11],"than":[12,128,195],"linear":[13],"reference":[14],"sequences.":[15],"However,":[16],"scalable":[17,149],"enumeration":[18],"and":[19,96,145,199,209],"indexing":[20],"of":[21,33,84,99,108,114,123,155,213],"paths":[22,86,173,178],"in":[23,51,78],"such":[24],"graphs":[25,158],"remain":[26],"challenging":[27],"due":[28],"the":[30,104,115,121,124,130,135,165,214],"combinatorial":[31],"growth":[32,101],"possible":[34],"traversals.":[35],"We":[36],"propose":[37],"TIPE":[38,54,137,169,190],"(Tag-Based":[39],"Iterative":[40],"Path":[41],"Expansion),":[42],"a":[43,81,143],"general":[44,136],"framework":[45,116,141],"for":[46],"bounded,":[47],"signature-aware":[48],"path":[49,56,59,100,150],"construction":[50],"directed":[52],"graphs.":[53],"decouples":[55],"expansion":[57,65,131],"from":[58],"retention":[60,125,198],"by":[61,120,129,184],"combining":[62],"tag-controlled":[63],"local":[64],"with":[66],"explicit,":[67],"signature-based":[68],"bounded":[69,82,175],"retention.":[70],"At":[71],"each":[72],"iteration,":[73],"only":[74],"anchor":[75],"states":[76],"participate":[77],"expansion,":[79],"while":[80,159,206],"number":[83],"representative":[85,161],"is":[87,117],"retained":[88],"per":[89],"signature":[90,126,215],"class.":[91],"This":[92],"design":[93],"enables":[94],"early":[95],"sustained":[97],"control":[98],"without":[102],"materializing":[103],"full":[105],"exponential":[106],"set":[107],"candidate":[109],"paths.":[110],"The":[111,139],"computational":[112],"behavior":[113],"governed":[118],"primarily":[119],"choice":[122],"rather":[127],"mechanism":[132],"itself,":[133],"motivating":[134],"formulation.":[138],"proposed":[140],"provides":[142],"principled":[144],"interpretable":[146],"approach":[147],"construction,":[151],"supporting":[152],"controlled":[153],"exploration":[154],"complex":[156],"genome":[157],"preserving":[160],"structural":[162],"diversity.":[163],"In":[164],"evaluated":[166],"high-branching":[167],"settings,":[168],"preserves":[170],"structurally":[171],"valid":[172],"under":[174],"exploration,":[176],"including":[177],"that":[179],"may":[180],"not":[181],"be":[182],"captured":[183],"haplotype-only":[185],"traversal.":[186],"Under":[187],"output-size-matched":[188],"comparison,":[189],"achieves":[191],"higher":[192],"exact":[193],"recall":[194,201],"deterministic":[196,208],"beam-style":[197],"comparable":[200],"stochastic":[203],"random":[204],"pruning,":[205],"providing":[207],"explicitly":[210],"structured":[211],"coverage":[212],"space.":[216]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2026-07-17T00:00:00"}