{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PBHO7P652VRYBQ23BYQ4E7SSKH","short_pith_number":"pith:PBHO7P65","schema_version":"1.0","canonical_sha256":"784eefbfddd56380c35b0e21c27e5251cbb916293c712bb9368f132682d433b4","source":{"kind":"arxiv","id":"1007.0942","version":1},"attestation_state":"computed","paper":{"title":"Efficient chaining of seeds in ordered trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.QM","authors_text":"Anne-Laure Gaillard (LaBRI), C\\'edric Chauve, Julien Allali (LaBRI), Pascal Ferraro (LaBRI, PIMS)","submitted_at":"2010-07-06T16:31:11Z","abstract_excerpt":"We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent with respect to postfix order and ancestrality. This problem is a natural extension of a similar problem for sequences, and has applications in computational biology, such as mining a database of RNA secondary structures. For the chaining problem with a set of m constant size seeds, we describe an algorithm with complexity O(m2 log(m)) in time and O(m2) in space."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1007.0942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2010-07-06T16:31:11Z","cross_cats_sorted":[],"title_canon_sha256":"ae34f3cadc2298a48c833feafb257a640537765fb28c9520b5c3bd7bbe47aa2b","abstract_canon_sha256":"72e9e43c5b10aa52e9835e86fe44124cc98fd87fb19c8b02c7475ff5dda1d0f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:06:31.942374Z","signature_b64":"x4DJise0m99obPEQ/5mstd8vWSVcBQgZ8u9dyWaNXqmLHrLGMD7r6B1S7DLisxb4SOnbTRjqxe9/8Yuk4EG0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"784eefbfddd56380c35b0e21c27e5251cbb916293c712bb9368f132682d433b4","last_reissued_at":"2026-05-18T02:06:31.941647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:06:31.941647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient chaining of seeds in ordered trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.QM","authors_text":"Anne-Laure Gaillard (LaBRI), C\\'edric Chauve, Julien Allali (LaBRI), Pascal Ferraro (LaBRI, PIMS)","submitted_at":"2010-07-06T16:31:11Z","abstract_excerpt":"We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent with respect to postfix order and ancestrality. This problem is a natural extension of a similar problem for sequences, and has applications in computational biology, such as mining a database of RNA secondary structures. For the chaining problem with a set of m constant size seeds, we describe an algorithm with complexity O(m2 log(m)) in time and O(m2) in space."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.0942","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1007.0942","created_at":"2026-05-18T02:06:31.941771+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.0942v1","created_at":"2026-05-18T02:06:31.941771+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.0942","created_at":"2026-05-18T02:06:31.941771+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBHO7P652VRY","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBHO7P652VRYBQ23","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBHO7P65","created_at":"2026-05-18T12:26:12.377268+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PBHO7P652VRYBQ23BYQ4E7SSKH","json":"https://pith.science/pith/PBHO7P652VRYBQ23BYQ4E7SSKH.json","graph_json":"https://pith.science/api/pith-number/PBHO7P652VRYBQ23BYQ4E7SSKH/graph.json","events_json":"https://pith.science/api/pith-number/PBHO7P652VRYBQ23BYQ4E7SSKH/events.json","paper":"https://pith.science/paper/PBHO7P65"},"agent_actions":{"view_html":"https://pith.science/pith/PBHO7P652VRYBQ23BYQ4E7SSKH","download_json":"https://pith.science/pith/PBHO7P652VRYBQ23BYQ4E7SSKH.json","view_paper":"https://pith.science/paper/PBHO7P65","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.0942&json=true","fetch_graph":"https://pith.science/api/pith-number/PBHO7P652VRYBQ23BYQ4E7SSKH/graph.json","fetch_events":"https://pith.science/api/pith-number/PBHO7P652VRYBQ23BYQ4E7SSKH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBHO7P652VRYBQ23BYQ4E7SSKH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBHO7P652VRYBQ23BYQ4E7SSKH/action/storage_attestation","attest_author":"https://pith.science/pith/PBHO7P652VRYBQ23BYQ4E7SSKH/action/author_attestation","sign_citation":"https://pith.science/pith/PBHO7P652VRYBQ23BYQ4E7SSKH/action/citation_signature","submit_replication":"https://pith.science/pith/PBHO7P652VRYBQ23BYQ4E7SSKH/action/replication_record"}},"created_at":"2026-05-18T02:06:31.941771+00:00","updated_at":"2026-05-18T02:06:31.941771+00:00"}