## P-Mod statistics

*info*

*info*

### Citations per year

*info*

### Tool usage distribution map

*info*

*info*

### Associated diseases

*info*

### Popular tool citations

*chevron_left*PTM identification

*chevron_right*

## Protocols

## P-Mod specifications

### Information

Unique identifier | OMICS_06917 |
---|---|

Name | P-Mod |

Software type | Package/Module |

Interface | Command line interface |

Restrictions to use | None |

Operating system | Windows |

Programming languages | C++ |

Computer skills | Advanced |

Stability | Stable |

Maintained | Yes |

### Versioning

No version available

## Publication for P-Mod

*library_books*

### P-Mod: an algorithm and software to map modifications to peptide sequences using tandem MS data.

## P-Mod citations

(43)*library_books*

### 18FDG PET/CT and molecular markers to predict response to neoadjuvant chemotherapy and outcome in HER2 negative advanced luminal breast cancers patients

[…] y, we classified the mutations into two groups using the International Agency for Research on Cancer (IARC) p53 database, according to their impact on the protein: presence of a modified p53 protein (**p-MOD**) and absence of a p53 protein (p-NO) []. […]

*library_books*

### Quantifying the impact of simple DNA parameters on the cyclization J factor for single basepair addition families

[…] ata (Ni, yi), where yi is the value of log10J estimated by Monte Carlo for a molecule with Ni basepairs, we perform a least-squares fit to a function of the form28y=a+b(N−φ)+c[f(N,φ,p)]2,where29f(N,φ,**p)=mod**(N−φ+p2,p)−p2.We use the modulo operation “mod” to generate periodic behavior. By definition, mod (a, p) gives the remainder when the number a is divided by p. Thus, in the formula above, whenev […]

*library_books*

### Fast and efficient short read mapping based on a succinct hash index

[…] of the set of positions P in the given reference genome sequence into lstep mutually disjoint sets Pi, 0≤i

*library_books*

### Compact FPGA hardware architecture for public key encryption in embedded devices

[…] ed as A′ × B′ × R−1 mod p.Algorithm 2 Montgomery multiplication algorithm (MMA)Require: Integers A′, B′, R = 2N, and p a N-bit prime number.Ensure: A′ × B′ × R−1 mod p1: t ← A′ × B′2: q ← (t mod R) × **p′ mod** R3: u ← (t + qp)/R4: if
u ≥ p
then5: u ← u − p6: end if7: return
u;The transformation of A to A′ and viceversa can be done using the MMA algorithm, since A′ = MMA(A, R2), and A = MMA(A′, 1).Th […]

*library_books*

### Investigating population continuity with ancient DNA under a spatially explicit simulation framework

[…] s slightly more affected than t0¯
anc, and that t1¯ also diminishes but less than t0¯ (Fig. ). Increasing the population structure thus results in smaller genetic diversity within population samples (**π
mod**
, π
anc,
H
mod and H
anc in Table ) and in more genetic differentiation between serial population samples, as measured by the Fst, which is proportional to t¯1−t¯0t¯1 []. The particular cases of […]

*library_books*

### Scheduling multi task jobs with extra utility in data centers

[…] sume 〈t,j〉 represent in slot t, machine M
1 to M
j are used. Therefore, the ending time after scheduling p tasks from time t and after machine M
j continuously is t+j+p+1m, and at the ending time, (j+**p) mod** m machines are used. In this paper, 〈t+1,0〉 equals to 〈t,m〉 representing in slot t, all the m machines are used.Define 〈t,j〉<〈t
′,j
′〉 if t

## P-Mod reviews

Be the first to review P-Mod