A subset-orientated algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries.
Libraries of cyclic peptides are being synthesized using combinatorial chemistry for high throughput screening in the drug discovery process. This paper describes the min_syn_steps.cpp program (available at http://www.imb.uq.edu.au/groups/smythe/tran), which after inputting a list of cyclic peptides to be synthesized, removes cyclic redundant sequences and calculates synthetic strategies which minimize the synthetic steps as well as the reagent requirements. The synthetic steps and reagent requirements could be minimized by finding common subsets within the sequences for block synthesis. Since a brute-force approach to search for optimum synthetic strategies is impractically large, a subset-orientated approach is utilized here to limit the size of the search.
Tran
Tran Trung
TT
The Centre for Drug Design and Development, Institute for Molecular Bioscience, University of Queensland, Brisbane, Australia. tran@doctor.com
Bryant
Darryn
D
Smythe
Mark
M