{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FVVZJ7B63D3ESMIEZWOSHK4PHG","short_pith_number":"pith:FVVZJ7B6","schema_version":"1.0","canonical_sha256":"2d6b94fc3ed8f6493104cd9d23ab8f39b4c2ba7b2788e24647156953674bd947","source":{"kind":"arxiv","id":"1705.06559","version":1},"attestation_state":"computed","paper":{"title":"Exemplar or Matching: Modeling DCJ Problems with Unequal Content Genome Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","q-bio.GN"],"primary_cat":"cs.DS","authors_text":"David A. Bader, Jijun Tang, Stephen W. Schaeffer, Zhaoming Yin","submitted_at":"2017-05-18T12:53:56Z","abstract_excerpt":"The edit distance under the DCJ model can be computed in linear time for genomes with equal content or with Indels. But it becomes NP-Hard in the presence of duplications, a problem largely unsolved especially when Indels are considered. In this paper, we compare two mainstream methods to deal with duplications and associate them with Indels: one by deletion, namely DCJ-Indel-Exemplar distance; versus the other by gene matching, namely DCJ-Indel-Matching distance. We design branch-and-bound algorithms with set of optimization methods to compute exact distances for both. Furthermore, median pro"},"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":"1705.06559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-18T12:53:56Z","cross_cats_sorted":["cs.CE","q-bio.GN"],"title_canon_sha256":"f451df73bd5b812f90bb73f673242ecddeb9a91145df508eca8088d83a0c5fd9","abstract_canon_sha256":"f86f4300b1bc4c4f74e744dcb1cd44d619b2940e7560679df8282df57e55b0c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:39.093083Z","signature_b64":"ONsa/NoJFwENjei67oSt8DNo5g9VFtKPAC0FUos2d/nZFecBl/kvpvpee3WFSbfxlO4e69GfRAv7orNfwOekCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d6b94fc3ed8f6493104cd9d23ab8f39b4c2ba7b2788e24647156953674bd947","last_reissued_at":"2026-05-18T00:43:39.092604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:39.092604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exemplar or Matching: Modeling DCJ Problems with Unequal Content Genome Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","q-bio.GN"],"primary_cat":"cs.DS","authors_text":"David A. Bader, Jijun Tang, Stephen W. Schaeffer, Zhaoming Yin","submitted_at":"2017-05-18T12:53:56Z","abstract_excerpt":"The edit distance under the DCJ model can be computed in linear time for genomes with equal content or with Indels. But it becomes NP-Hard in the presence of duplications, a problem largely unsolved especially when Indels are considered. In this paper, we compare two mainstream methods to deal with duplications and associate them with Indels: one by deletion, namely DCJ-Indel-Exemplar distance; versus the other by gene matching, namely DCJ-Indel-Matching distance. We design branch-and-bound algorithms with set of optimization methods to compute exact distances for both. Furthermore, median pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06559","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":"1705.06559","created_at":"2026-05-18T00:43:39.092672+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.06559v1","created_at":"2026-05-18T00:43:39.092672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06559","created_at":"2026-05-18T00:43:39.092672+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVVZJ7B63D3E","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVVZJ7B63D3ESMIE","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVVZJ7B6","created_at":"2026-05-18T12:31:15.632608+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/FVVZJ7B63D3ESMIEZWOSHK4PHG","json":"https://pith.science/pith/FVVZJ7B63D3ESMIEZWOSHK4PHG.json","graph_json":"https://pith.science/api/pith-number/FVVZJ7B63D3ESMIEZWOSHK4PHG/graph.json","events_json":"https://pith.science/api/pith-number/FVVZJ7B63D3ESMIEZWOSHK4PHG/events.json","paper":"https://pith.science/paper/FVVZJ7B6"},"agent_actions":{"view_html":"https://pith.science/pith/FVVZJ7B63D3ESMIEZWOSHK4PHG","download_json":"https://pith.science/pith/FVVZJ7B63D3ESMIEZWOSHK4PHG.json","view_paper":"https://pith.science/paper/FVVZJ7B6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.06559&json=true","fetch_graph":"https://pith.science/api/pith-number/FVVZJ7B63D3ESMIEZWOSHK4PHG/graph.json","fetch_events":"https://pith.science/api/pith-number/FVVZJ7B63D3ESMIEZWOSHK4PHG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVVZJ7B63D3ESMIEZWOSHK4PHG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVVZJ7B63D3ESMIEZWOSHK4PHG/action/storage_attestation","attest_author":"https://pith.science/pith/FVVZJ7B63D3ESMIEZWOSHK4PHG/action/author_attestation","sign_citation":"https://pith.science/pith/FVVZJ7B63D3ESMIEZWOSHK4PHG/action/citation_signature","submit_replication":"https://pith.science/pith/FVVZJ7B63D3ESMIEZWOSHK4PHG/action/replication_record"}},"created_at":"2026-05-18T00:43:39.092672+00:00","updated_at":"2026-05-18T00:43:39.092672+00:00"}