Digest Fingerprint Matching¶
Compare measured fragments of a specifically cleaved protein or DNA sample with fragments predicted from candidate sequences under the same cleavage rule.
Core Idea¶
Digest fingerprint matching tests a real protein or DNA sample by cutting it under a stated sequence-sensitive rule, measuring the fragments, and comparing them with fragments predicted from candidate sequences under that same rule.[1][2] A good match may support identification among known proteins or show that a DNA clone has the tested structure of an expected design.[1][2] It is evidence under a chosen tolerance, not a complete sequence reading or a guarantee of uniqueness.[1][2]
The protein and DNA examples use different cutters, instruments and decision rules.[1][2] Their common method is the physical digest → measured fragments → same-rule prediction → bounded comparison, not one shared numerical score.
Structural Signature¶
Five parts must work together:
1. Physical sample: a real molecule whose identity or structure is being tested.[1][2] 2. Cutting rule: a stated protease or restriction enzyme whose action depends on sequence context.[1][2] 3. Observed fragments: measured peptide masses or DNA fragment lengths, with stated measurement limits.[1][2] 4. Predicted fragments: candidate sequences cut computationally under the same rule.[1][2] 5. Decision rule: an explicit tolerance or acceptance test that reports support, failure or ambiguity.[1][2]
Without a physical digest there is only prediction. Without same-rule predicted fragments there is a measured profile, but not this test. Without a decision rule, visual resemblance cannot establish the claimed match.
Scope of Application¶
The method works when the molecule can be cut reproducibly, its fragments can be measured with useful resolution, and a candidate sequence or expected design can be tested against them. Henzel and colleagues identified known proteins from two-dimensional gel spots using peptide masses; Dharmadi and colleagues screened cloned DNA constructs using restriction fragments.[1][2] Different candidate sets lead to different questions: “Which known protein fits?” and “Does this clone fit the intended design?”
An incomplete reference can hide a true candidate, and a permissive size tolerance can allow a flawed DNA construct to pass.[1][2] A pass answers the declared fragment test at its resolution; it does not prove every residue or base is correct.[2]
Clarity¶
Ask what was cut, what was predicted, and what counts as a match. Henzel's FRAGFIT compared measured peptide masses with theoretical protein digests using a mass window and a minimum match count.[1] Dharmadi's DNA procedure compared observed fragment sizes and normalized abundance with expected fragments under its own thresholds.[2] The differing tests cannot be collapsed into a universal fingerprint score.
Manages Complexity¶
The five parts separate possible sources of disagreement: sample composition, cleavage, measurement, reference quality and acceptance rule. Henzel's mixed gel spot left one component unidentified when a database sequence had many unknown residues.[1] Dharmadi's procedure addressed extra and unresolved peaks, which affect how a measured trace can represent predicted fragments.[2]
Abstract Reasoning¶
For candidate sequence \(x\), predict fragments \(D_c(x)\) under cutting rule \(c\). Compare them with measured fragments \(O_c\) from the sample cut under that rule. A match is meaningful only after the tolerance and detection limits are specified. This notation explains the shared test; neither cited paper needs to use it.
The reverse inference is limited: passing the test does not exclude a different sequence with indistinguishable observed fragments or a defect hidden by tolerance. Dharmadi and colleagues used separate Sanger sequencing on selected clones and described digest-pass cases that disagreed with sequencing.[2]
Digest fingerprint matching is a subtype of Analytical Method: it selects inputs, transforms them into measured features, compares them with a reference, applies validity and quality conditions, and reports a bounded finding. Comparison and Measurement are important parts of the procedure, but neither alone contains its whole method.
Knowledge Transfer¶
Transfer the relation between physical fragments and same-rule predicted fragments from protein to DNA work; change the molecule, cutter, instrument and decision rule as needed. Henzel used trypsin and MALDI peptide masses; Dharmadi used restriction enzymes and capillary fragment measurements.[1][2] The score and threshold need their own justification in each application.
Examples¶
Protein identification. Henzel and colleagues digested proteins from E. coli gel spots with trypsin, measured peptide masses by MALDI, and searched theoretical digests of known protein sequences.[1] Here the gel spot is the sample, trypsin the cutting rule, peptide masses the observations, database digests the predictions, and FRAGFIT's mass/count criteria the decision.[1]
MOWSE, a named protein search. Pappin, Højrup and Bleasby reported Molecular Weight Search (MOWSE) in 1993: an indexed database search that compared peptide masses measured by mass spectrometry after digesting a sample against predicted fragments of candidate proteins, allowing for measurement error.[3][4] The sample, cutter, measured masses, indexed predictions and MOWSE search fill the same five method roles, while MOWSE's score is specific to that implementation.[3][4] Matrix Science credits Darryl Pappin at the Imperial Cancer Research Fund and Alan Bleasby at SERC Daresbury, and traces later rewritten MOWSE versions to the licensed Mascot product.[4] That lineage does not make MOWSE and Henzel's FRAGFIT the same program or establish an unchanged score in Mascot.[4][1]
DNA assembly verification. Dharmadi and colleagues digested cloned DNA constructs and compared capillary fragment peaks with fragments predicted from intended designs.[2] In their Figure 5c, the 12-part assembly clone #54520 passed a BsrDI comparison even though some expected peaks were partly or fully unresolved.[2] Figure 5b's unresolved pair and three impurity peaks belong to a different cloned building block, #30655.[2]
Relationships to Other Abstractions¶
Current abstraction Digest Fingerprint Matching Domain-specific
Parents (1) — outgoing typed relations
-
Digest Fingerprint Matching is a kind of Analytical Method Domain-specific
Digest fingerprint matching is an analytical method that selects a physical molecular sample, transforms it into measured cleavage fragments, compares those fragments with same-rule sequence predictions, and reports a bounded match decision.
Hierarchy path (1) — routes to 1 parentless root
- Digest Fingerprint Matching → is a kind of Analytical Method
Neighborhood in Abstraction Space¶
Digest Fingerprint Matching sits in a sparse region of the domain-specific corpus (93rd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (2769 abstractions)
Nearest neighbors
- Viability PCR — 0.79
- Gap Penalty — 0.79
- YARA — 0.78
- Comparative Genomic Hybridization — 0.78
- DNA Laddering — 0.78
Computed from structural-signature embeddings · 2026-10-25
Not to Be Confused With¶
- Direct sequencing: sequencing can expose changes that a digest comparison misses.[2]
- Any fragment profile: making a pattern without a same-rule candidate prediction and decision does not complete this method.[1][2]
- Guaranteed identity: finite reference coverage, peak resolution and tolerance limit the conclusion.[1][2]
References¶
[1] Henzel, W. J.; Billeci, T. M.; Stults, J. T.; Wong, S. C.; Grimley, C.; Watanabe, C. “Identifying Proteins from Two-Dimensional Gels by Molecular Mass Searching of Peptide Fragments in Protein Sequence Databases.” Proceedings of the National Academy of Sciences 90 (1993), 5011–5015. DOI: 10.1073/pnas.90.11.5011. Full original article. Consulted printed pp.5011–5014, especially methods, FRAGFIT algorithm and Table 2. registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g ↩h ↩i ↩j ↩k ↩l ↩m ↩n ↩o ↩p ↩q ↩r ↩s
[2] Dharmadi, Y.; Patel, K.; Shapland, E.; Hollis, D.; Slaby, T.; Klinkner, N.; Dean, J.; Chandran, S. S. “High-Throughput, Cost-Effective Verification of Structural DNA Assembly.” Nucleic Acids Research 42 (2014), e22. DOI: 10.1093/nar/gkt1088. Full original article. Consulted PDF pp.1–8, especially pp.4–5 match algorithm, p.7 Figure 5 discussion and p.8 figure/limits. registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g ↩h ↩i ↩j ↩k ↩l ↩m ↩n ↩o ↩p ↩q ↩r ↩s ↩t ↩u ↩v
[3] Pappin, D. J. C.; Højrup, P.; Bleasby, A. J. “Rapid Identification of Proteins by Peptide-Mass Fingerprinting.” Current Biology 3, no. 6 (1993), 327–332. DOI: 10.1016/0960-9822(93)90195-T. Publisher abstract. Consulted abstract only, especially Results; full original text and scoring tables were not available in this review. registry ↩a ↩b
[4] Matrix Science. “A History of Mascot and Mowse.” Developer and licensee history. Undated page. Consulted paragraphs on the original MOWSE collaboration, scoring observation, later MOWSE II/III rewrite, licence and Mascot naming. This is a retrospective first-party account, not the 1993 algorithm paper. registry ↩a ↩b ↩c ↩d