{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4DQJ2NTJSEFAGVALOQDMSZA3HF","short_pith_number":"pith:4DQJ2NTJ","schema_version":"1.0","canonical_sha256":"e0e09d3669910a03540b7406c9641b394ef68d1aafd49c2543f6a1963b8e09fc","source":{"kind":"arxiv","id":"1110.2893","version":1},"attestation_state":"computed","paper":{"title":"String Matching with Variable Length Gaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Kofoed Wind, Hjalte Wedel Vildh{\\o}j, Inge Li Goertz, Philip Bille","submitted_at":"2011-10-13T11:13:48Z","abstract_excerpt":"We consider string matching with variable length gaps. Given a string $T$ and a pattern $P$ consisting of strings separated by variable length gaps (arbitrary strings of length in a specified range), the problem is to find all ending positions of substrings in $T$ that match $P$. This problem is a basic primitive in computational biology applications. Let $m$ and $n$ be the lengths of $P$ and $T$, respectively, and let $k$ be the number of strings in $P$. We present a new algorithm achieving time $O(n\\log k + m +\\alpha)$ and space $O(m + A)$, where $A$ is the sum of the lower bounds of the len"},"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":"1110.2893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-13T11:13:48Z","cross_cats_sorted":[],"title_canon_sha256":"045663c7c0cfd9e622d7090044ba3d4aaa83c4d39955162b592a2e6e59ce5c03","abstract_canon_sha256":"f7228e6c76135497088aee33274cf72ea54dee2c4c60d6df6fb784ece8be5c27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:06.723063Z","signature_b64":"VfZKpN5e8DL+FeVS/NP+fUeGhEq7+Lua3qc5yYK65GD9XeL3AOGpmrbF6JOgI+rF/8Yoc5HuvQj3/XkSbzlRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0e09d3669910a03540b7406c9641b394ef68d1aafd49c2543f6a1963b8e09fc","last_reissued_at":"2026-05-18T04:11:06.722294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:06.722294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"String Matching with Variable Length Gaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Kofoed Wind, Hjalte Wedel Vildh{\\o}j, Inge Li Goertz, Philip Bille","submitted_at":"2011-10-13T11:13:48Z","abstract_excerpt":"We consider string matching with variable length gaps. Given a string $T$ and a pattern $P$ consisting of strings separated by variable length gaps (arbitrary strings of length in a specified range), the problem is to find all ending positions of substrings in $T$ that match $P$. This problem is a basic primitive in computational biology applications. Let $m$ and $n$ be the lengths of $P$ and $T$, respectively, and let $k$ be the number of strings in $P$. We present a new algorithm achieving time $O(n\\log k + m +\\alpha)$ and space $O(m + A)$, where $A$ is the sum of the lower bounds of the len"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2893","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":"1110.2893","created_at":"2026-05-18T04:11:06.722410+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.2893v1","created_at":"2026-05-18T04:11:06.722410+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2893","created_at":"2026-05-18T04:11:06.722410+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DQJ2NTJSEFA","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DQJ2NTJSEFAGVAL","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DQJ2NTJ","created_at":"2026-05-18T12:26:20.644004+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/4DQJ2NTJSEFAGVALOQDMSZA3HF","json":"https://pith.science/pith/4DQJ2NTJSEFAGVALOQDMSZA3HF.json","graph_json":"https://pith.science/api/pith-number/4DQJ2NTJSEFAGVALOQDMSZA3HF/graph.json","events_json":"https://pith.science/api/pith-number/4DQJ2NTJSEFAGVALOQDMSZA3HF/events.json","paper":"https://pith.science/paper/4DQJ2NTJ"},"agent_actions":{"view_html":"https://pith.science/pith/4DQJ2NTJSEFAGVALOQDMSZA3HF","download_json":"https://pith.science/pith/4DQJ2NTJSEFAGVALOQDMSZA3HF.json","view_paper":"https://pith.science/paper/4DQJ2NTJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.2893&json=true","fetch_graph":"https://pith.science/api/pith-number/4DQJ2NTJSEFAGVALOQDMSZA3HF/graph.json","fetch_events":"https://pith.science/api/pith-number/4DQJ2NTJSEFAGVALOQDMSZA3HF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DQJ2NTJSEFAGVALOQDMSZA3HF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DQJ2NTJSEFAGVALOQDMSZA3HF/action/storage_attestation","attest_author":"https://pith.science/pith/4DQJ2NTJSEFAGVALOQDMSZA3HF/action/author_attestation","sign_citation":"https://pith.science/pith/4DQJ2NTJSEFAGVALOQDMSZA3HF/action/citation_signature","submit_replication":"https://pith.science/pith/4DQJ2NTJSEFAGVALOQDMSZA3HF/action/replication_record"}},"created_at":"2026-05-18T04:11:06.722410+00:00","updated_at":"2026-05-18T04:11:06.722410+00:00"}