| Literature DB >> 31296178 |
Vincent Demolombe1, Alexandre G de Brevern2,3,4,5, Liza Felicori6, Christophe NGuyen7, Ricardo Andrez Machado de Avila8, Lionel Valera9, Bénédicte Jardin-Watelet9, Géraldine Lavigne10, Aurélien Lebreton11, Franck Molina7, Violaine Moreau12.
Abstract
BACKGROUND: Bioinformatics methods are helpful to identify new molecules for diagnostic or therapeutic applications. For example, the use of peptides capable of mimicking binding sites has several benefits in replacing a protein which is difficult to produce, or toxic. Using peptides is less expensive. Peptides are easier to manipulate, and can be used as drugs. Continuous epitopes predicted by bioinformatics tools are commonly used and these sequential epitopes are used as is in further experiments. Numerous discontinuous epitope predictors have been developed but only two bioinformatics tools have been proposed so far to predict peptide sequences: Superficial and PEPOP 2.0. PEPOP 2.0 can generate series of peptide sequences that can replace continuous or discontinuous epitopes in their interaction with their cognate antibody.Entities:
Keywords: Ag-ab interaction; Antigenicity; B-cell epitope; Discontinuous and continuous epitope; IPP; Immunogenicity; Molecular mimicry; Peptide design; Protein surface; Structural bioinformatics
Mesh:
Substances:
Year: 2019 PMID: 31296178 PMCID: PMC6625012 DOI: 10.1186/s12859-019-2867-5
Source DB: PubMed Journal: BMC Bioinformatics ISSN: 1471-2105 Impact factor: 3.169
PEPOP 2.0 methods and their main characteristics
| Category | Sub category | Name | Full name | Composing elements | Characteristic | Epitope type mimetic |
|---|---|---|---|---|---|---|
| Sequential | FPS | Flanking Protein Sequence | protein sequence | Extension of a segment with the protein sequence | continuous | |
| Nearest Neigbors | Prime methods | NN | Nearest Neighbors | segments in the natural orientation | Sequentially concatenation of NN segments | discontinuous |
| uNN | upset NN | segments in the natural or reverse orientation | Sequentially concatenation of NN segments | |||
| FNN | Flanking NN | segments in the natural orientation | Concatenation in turn C- and N-terminally of NN segments | |||
| ONN | Optimized NN | segments in the natural orientation | Shortest path between the segments of NN method | |||
| OFN | Optimized Flanking NN | segments in the natural orientation | Shortest path between the segments of FNN peptides | |||
| OPP | Optimized Patched segments Path | segments in the natural orientation | Shortest path between the segments in a 10 Å-radius patch | |||
| Prime methods with ALA linker | NNala | NN with ALA linker | segments in the natural orientation | ALA linkers inserted between segments of NN method | ||
| uNNala | upset NN with ALA linker | segments in the natural orientation | ALA linkers inserted between segments of uNN method | |||
| ONNala | Optimized NN with ALA linker | segments in the natural orientation | ALA linkers inserted between segments of ONN method | |||
| FNala | Flanking NN with ALA linker | segments in the natural orientation | ALA linkers inserted between segments of FNN method | |||
| OFNala | Optimized Flanking NN with ALA linker | segments in the natural orientation | ALA linkers inserted between segments of OFN method | |||
| OPPala | Optimized Patched segments path with ALA linker | segments in the natural orientation | ALA linkers inserted between segments of OPP method | |||
| Prime methods with structural-based linker | NNsa | NN with SA linker | segments in the natural orientation | Linkers computed from SA inserted between segments of NN method | ||
| ONNsa | Optimized NN with SA linker | segments in the natural orientation | Linkers computed from SA inserted between segments of ONN method | |||
| FNsa | Flanking NN with SA linker | segments in the natural orientation | Linkers computed from SA inserted between segments of FNN method | |||
| OFNsa | Optimized Flanking NN with SA linker | segments in the natural orientation | Linkers computed from SA inserted between segments of OFN method | |||
| OPPsa | Optimized Patched segments Path with SA linker | segments in the natural orientation | Linkers computed from SA inserted between segments of OPP method | |||
| Prime methods with superposed structural-based linker | NNsas | NN with SAS linker | segments in the natural orientation | Linkers computed from SAS inserted between segments of NN method | ||
| ONNsas | Optimized NN with SAS linker | segments in the natural orientation | Linkers computed from SAS inserted between segments of ONN method | |||
| FNsas | Flanking NN with SAS linker | segments in the natural orientation | Linkers computed from SAS inserted between segments of FNN method | |||
| OFNsas | Optimized Flanking NN with SAS linker | segments in the natural orientation | Linkers computed from SAS inserted between segments of OFN method | |||
| OPPsas | Optimized Patched segments path with SAS linker | segments in the natural orientation | Linkers computed from SAS inserted between segments of OPP method | |||
| Graph Theory | SHP methods | SHPnat | SHP natural | segments in the natural orientation | Shortest path between segments using Dijkstra’s algorithm | |
| SHPrev | SHP reverse | segments in the natural or reverse orientation | Shortest path between segments using Dijkstra’s algorithm | |||
| SHPaa | SHP amino acids | amino acids | Shortest path between segments using Dijkstra’s algorithm | |||
| TSP methods | TSPnat1 | TSP natural 1 | segments in the natural orientation | Shortest path between segments using Dantzig & Fulkerson’s algorithm and most favorable interacting parameters | ||
| TSPnat2 | TSP natural 2 | segments in the natural orientation | Shortest path between segments using Dantzig & Fulkerson’s algorithm | |||
| TSPnat3 | TSP natural 3 | segments in the natural orientation | Shortest path using Dantzig & Fulkerson’s algorithm according to the number of segments | |||
| TSPnat4 | TSP natural 4 | segments in the natural orientation | Shortest path using Dantzig & Fulkerson’s algorithm including the 2 closest segments | |||
| TSPrev1 | TSP reverse 1 | segments in the natural or reverse orientation | Shortest path using Dantzig & Fulkerson’s algorithm and most favorable interacting parameters | |||
| TSPrev2 | TSP reverse 2 | segments in the natural or reverse orientation | Shortest path using Dantzig & Fulkerson’s algorithm | |||
| TSPrev3 | TSP reverse 3 | segments in the natural or reverse orientation | Shortest path using Dantzig & Fulkerson’s algorithm according to the number of segments | |||
| TSPrev4 | TSP reverse 4 | segments in the natural or reverse orientation | Shortest path using Dantzig & Fulkerson’s algorithm including the 2 closest segments | |||
| TSPaa | TSP amino acids | amino acids | Shortest path using Dantzig & Fulkerson’s algorithm |
ALA alanine, NN nearest neighbor, SA structural alphabet, SAS superposed structural alphabet, SHP SHortest Path algorithm, TSP Traveling Salesman Problem algorithm
Fig. 1PEPOP 2.0 web-site. The first result page of PEPOP 2.0, after the user gives the 3D structure of the protein, proposes 3 different ways to design peptides. a The ‘One Specific Peptide Design’ predicts one peptide at a time through 5 steps where the user has to select the reference segment (first insert), the method of extension, the area of extension and the peptide length; the fifth step (second insert) gives the peptide sequence and displays it on the 3D structure of the protein. b To design peptides in the ‘Paired Peptide Design’ section, the user selects the method of extension, the peptide length and eventually the aa from which the first pair has to be determined (first insert); the 5 peptide pairs are summarized in one side of the browser and displayed on the 3D structure of the protein on the other side of the browser. c In the ‘Peptide Bank Design’, the user has to select the method(s) and the peptide length (first insert); all the predicted peptides can be displayed on the 3D structure of the protein (second insert)
Fig. 2Reactivity of mouse immune serum raised using a “discontinuous” peptide against trimeric full length adiponectin (LMW adiponectin) and a control protein (HSA). The segments composing the peptide are displayed on the surface of the protein
Fig. 3Example of paired predicted peptides on the A2 domain of FVIII. Paired peptides have been predicted from two distinct regions on the A2 domain of FVIII. The 6 peptides are in distinct and opposite (two by two) regions of the protein. The first paired peptides is in yellow, the second in blue and the third in red. The two 3D structure views are orthogonal
Fig. 4Reactivity of monoclonal antibodies, LimAb7, DPC and GAD65 with “discontinuous” peptides predicted from the 3D structure of respectively LiD1 and GAD65. The peptides have been prepared by the Spot technology. The reactivity was controlled with anti-Fc pAbs alone. The reactive peptides with the mAb are displayed on the 3D structure of the corresponding protein
Fig. 5Inhibition obtained with different amounts of a peptide representative of the C2 domain of FVIII in x-MAP inhibition assays using plasma sample