Premium
Design of combinatorial protein libraries of optimal size
Author(s) -
Saraf Manish C.,
Gupta Anshuman,
Maranas Costas D.
Publication year - 2005
Publication title -
proteins: structure, function, and bioinformatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.699
H-Index - 191
eISSN - 1097-0134
pISSN - 0887-3585
DOI - 10.1002/prot.20490
Subject(s) - crossover , computer science , set (abstract data type) , template , lactobacillus casei , computational biology , algorithm , biology , genetics , artificial intelligence , bacteria , programming language
In this article we introduce a computational procedure, OPTCOMB (Optimal Pattern of Tiling for COMBinatorial library design), for designing protein hybrid libraries that optimally balance library size with quality. The proposed procedure is directly applicable to oligonucleotide ligation‐based protocols such as GeneReassembly, DHR, SISDC, and many more. Given a set of parental sequences and the size ranges of the parental sequence fragments, OPTCOMB determines the optimal junction points (i.e., crossover positions) and the fragment contributing parental sequences at each one of the junction points. By rationally selecting the junction points and the contributing parental sequences, the number of clashes (i.e., unfavorable interactions) in the library is systematically minimized with the aim of improving the overall library quality. Using OPTCOMB, hybrid libraries containing fragments from three different dihydrofolate reductase sequences ( Escherichia coli, Bacillus subtilis, and Lactobacillus casei ) are computationally designed. Notably, we find that there exists an optimal library size when both the number of clashes between the fragments composing the library and the average number of clashes per hybrid in the library are minimized. Results reveal that the best library designs typically involve complex tiling patterns of parental segments of unequal size hard to infer without relying on computational means. Proteins 2005. © 2005 Wiley‐Liss, Inc.