Abstract

The problem of mapping the positions of the unique binding sites of several monoclonal antibodies on a linear protein structure is considered. Data giving the incidence of binding of individual antibodies to fragments of the protein obtained from it by the incomplete chemical or enzymatic digestion are used to formulate a series of linear programming problems. The solution to these problems shows which orderings of binding sites are possible, and gives upper and lower bounds for the relative positions of the sites.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call