PARPST: a PARallel algorithm to find peptide sequence tags-1
pointers. edges are represented as continued arrows, pointers are represented as broken arrows.(a) If [] points to a node different from (e.g. a predecessor of ) and different from [[]] = , then we assign [] = . (b) If has all the predecessors with pointers pointing to themselves or predecessors wit...
| Main Authors: | , , , |
|---|---|
| Format: | Still Image |
| Language: | unknown |
| Published: |
figshare
2011
|
| Subjects: | |
| Online Access: | https://dx.doi.org/10.6084/m9.figshare.25158 https://figshare.com/articles/figure/PARPST:_a_PARallel_algorithm_to_find_peptide_sequence_tags-1/25158 |
| Summary: | pointers. edges are represented as continued arrows, pointers are represented as broken arrows.(a) If [] points to a node different from (e.g. a predecessor of ) and different from [[]] = , then we assign [] = . (b) If has all the predecessors with pointers pointing to themselves or predecessors with pointing to the same node , then we assign [] = . (c) If all the predecessors of have the pointers cycling on themselves or pointing to a node without predecessors, we consider the predecessor having the maximum distance and we assign [i]= . Copyright information: Taken from "PARPST: a PARallel algorithm to find peptide sequence tags"http://www.biomedcentral.com/1471-2105/9/S4/S11BMC Bioinformatics 2008;9(Suppl 4):S11-S11.Published online 25 Apr 2008PMCID:PMC2367638. |
|---|