{"id":"https://openalex.org/W4414684983","doi":"https://doi.org/10.1109/isit63088.2025.11195664","title":"Reconstructing Graphs from Subgraph Compositions","display_name":"Reconstructing Graphs from Subgraph Compositions","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4414684983","doi":"https://doi.org/10.1109/isit63088.2025.11195664"},"language":"en","primary_location":{"id":"doi:10.1109/isit63088.2025.11195664","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195664","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2504.00169","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066451214","display_name":"Antoine Dailly","orcid":null},"institutions":[{"id":"https://openalex.org/I4210088668","display_name":"Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement","ror":"https://ror.org/003vg9w96","country_code":"FR","type":"funder","lineage":["https://openalex.org/I4210088668"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Antoine Dailly","raw_affiliation_strings":["Université Clermont Auvergne, INRAE, UR TSCF,Clermont-Ferrand,France,63000","UR TSCF - Technologies et syst\u00e8mes d'information pour les agrosyst\u00e8mes (9 avenue Blaise Pascal CS 20085 F-63178 Aubi\u00e8re ; Domaine des Palaquins, F-03150 Montoldre - France)"],"affiliations":[{"raw_affiliation_string":"Université Clermont Auvergne, INRAE, UR TSCF,Clermont-Ferrand,France,63000","institution_ids":["https://openalex.org/I4210088668"]},{"raw_affiliation_string":"UR TSCF - Technologies et syst\u00e8mes d'information pour les agrosyst\u00e8mes (9 avenue Blaise Pascal CS 20085 F-63178 Aubi\u00e8re ; Domaine des Palaquins, F-03150 Montoldre - France)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071276295","display_name":"Tuomo Lehtil\u00e4","orcid":"https://orcid.org/0000-0003-2940-8088"},"institutions":[{"id":"https://openalex.org/I155660961","display_name":"University of Turku","ror":"https://ror.org/05vghhr25","country_code":"FI","type":"education","lineage":["https://openalex.org/I155660961"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Tuomo Lehtil\u00e4","raw_affiliation_strings":["University of Turku,Department of Mathematics and Statistics,Turku,Finland,FI-20014"],"affiliations":[{"raw_affiliation_string":"University of Turku,Department of Mathematics and Statistics,Turku,Finland,FI-20014","institution_ids":["https://openalex.org/I155660961"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5066451214"],"corresponding_institution_ids":["https://openalex.org/I4210088668"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2586891,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9891999959945679,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9891999959945679,"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"}},{"id":"https://openalex.org/T10215","display_name":"Semantic Web and Ontologies","score":0.9775000214576721,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9728000164031982,"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/substring","display_name":"Substring","score":0.6015999913215637},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5404999852180481},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45190000534057617},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.3779999911785126},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.376800000667572},{"id":"https://openalex.org/keywords/subclass","display_name":"Subclass","score":0.35760000348091125},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.3361000120639801}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6814000010490417},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.6015999913215637},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5404999852180481},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5386999845504761},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45190000534057617},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.421999990940094},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3779999911785126},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.376800000667572},{"id":"https://openalex.org/C2776194381","wikidata":"https://www.wikidata.org/wiki/Q3965271","display_name":"Subclass","level":3,"score":0.35760000348091125},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.3361000120639801},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.323199987411499},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.31619998812675476},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30970001220703125},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3061000108718872},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3003000020980835},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.2897999882698059},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.2856999933719635},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26980000734329224},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2685000002384186},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.2581000030040741},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2547999918460846}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/isit63088.2025.11195664","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195664","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2504.00169","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.00169","pdf_url":"https://arxiv.org/pdf/2504.00169","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-05014814v1","is_oa":false,"landing_page_url":"https://hal.inrae.fr/hal-05014814","pdf_url":null,"source":{"id":"https://openalex.org/S4406922454","display_name":"SPIRE - Sciences Po Institutional REpository","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":"2025","raw_type":"Preprints, Working Papers, ..."},{"id":"pmh:oai:HAL:hal-05325988v1","is_oa":false,"landing_page_url":"https://hal.inrae.fr/hal-05325988","pdf_url":null,"source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","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":"2025 IEEE International Symposium on Information Theory (ISIT), Jun 2025, Ann Arbor, United States. pp.1-6, ⟨10.1109/ISIT63088.2025.11195664⟩","raw_type":"Conference papers"},{"id":"doi:10.48550/arxiv.2504.00169","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2504.00169","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2504.00169","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.00169","pdf_url":"https://arxiv.org/pdf/2504.00169","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,76],"study":[1],"a":[2,106,122],"generalization":[3],"of":[4,7,68,93,125],"the":[5,35,47,53,64,129],"problem":[6,23,48,67],"reconstructing":[8,69],"strings":[9],"from":[10,29,39,71],"their":[11,72],"substring":[12],"compositions":[13],"first":[14],"proposed":[15],"by":[16],"Acharya":[17],"et":[18],"al.":[19],"in":[20],"2015.":[21],"This":[22],"is":[24,37],"linked":[25],"to":[26],"information":[27,36,102],"retrieval":[28],"polymer-based":[30],"data":[31],"storage":[32],"systems":[33],"where":[34,121],"read":[38],"polymers":[40,54,58],"with":[41],"tandem":[42],"mass":[43],"(MS/MS)":[44],"spectrometers.":[45],"Previously":[46],"has":[49],"been":[50],"studied":[51],"when":[52],"are":[55,84,97],"strings/paths.":[56],"However,":[57],"allow":[59,99],"different":[60],"structures,":[61],"which":[62,82,96],"motivates":[63],"more":[65,101],"general":[66],"graphs":[70,83],"connected":[73],"subgraphs":[74],"compositions.":[75],"present":[77,89],"some":[78,118],"graph":[79,119],"classes":[80,120],"for":[81],"reconstructable.":[85],"In":[86],"particular,":[87],"we":[88,115],"an":[90],"infinite":[91],"subclass":[92],"subdivided":[94],"stars":[95],"reconstructable,":[98],"storing":[100],"than":[103],"strings,":[104],"have":[105],"simple":[107],"reconstruction":[108],"algorithm":[109],"and":[110],"structure.":[111],"Besides":[112],"positive":[113],"results,":[114],"also":[116],"give":[117],"large":[123],"number":[124],"non-isomorphic":[126],"labelings":[127],"yield":[128],"same":[130],"composition":[131],"multisets.":[132]},"counts_by_year":[],"updated_date":"2026-04-12T07:58:50.170612","created_date":"2025-10-01T00:00:00"}