ChemInform Abstract: α-Azidoesters as Divergent Intermediates for Combinatorial Generation of Glucofuranose Libraries of Novel N-Linked Glycopeptides.

ChemInform ◽  
2010 ◽  
Vol 27 (49) ◽  
pp. no-no
Author(s):  
T. W. BRANDSTETTER ◽  
C. DE LA FUENTE ◽  
Y. KIM ◽  
R. I. COOPER ◽  
D. J. WATKIN ◽  
...  
Keyword(s):  
Combinatorial Generation

scholarly journals FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION

2007 ◽  
Vol 18 (02) ◽  
pp. 263-293 ◽  
Author(s):  
TADAO TAKAOKA ◽  
STEPHEN VIOLICH
Keyword(s):  
Linear Space ◽  
Original Problem ◽  
Different Types ◽  
Combinatorial Generation

Some combinatorial generation problems can be broken into subproblems for which loopless algorithms already exist. This article discusses means by which loopless algorithms can be fused to produce a new loopless algorithm that solves the original problem. It demonstrates this method with two new loopless algorithms. The first generates well-formed parenthesis strings containing two different types of parentheses. The second generates multiset permutations in linear space using only arrays; it is simpler and more efficient than the recent algorithm of Korsh & LaFollette.

scholarly journals Combinatorial generation via permutation languages. I. Fundamentals

2020 ◽  
pp. 1
Author(s):  
Elizabeth Hartung ◽  
Hung P. Hoang ◽  
Torsten Mütze ◽  
Aaron Williams
Keyword(s):  
Combinatorial Generation

scholarly journals Method for Developing Combinatorial Generation Algorithms Based on AND/OR Trees and Its Application

Mathematics ◽  
2020 ◽  
Vol 8 (6) ◽  
pp. 962 ◽  
Author(s):  
Yuriy Shablya ◽  
Dmitry Kruchinin ◽  
Vladimir Kruchinin
Keyword(s):  
Explicit Expression ◽  
Generating Functions ◽  
Tree Structure ◽  
Mathematical Apparatus ◽  
Dyck Paths ◽  
Combinatorial Set ◽  
Combinatorial Generation ◽  
Basic Approaches

In this paper, we study the problem of developing new combinatorial generation algorithms. The main purpose of our research is to derive and improve general methods for developing combinatorial generation algorithms. We present basic general methods for solving this task and consider one of these methods, which is based on AND/OR trees. This method is extended by using the mathematical apparatus of the theory of generating functions since it is one of the basic approaches in combinatorics (we propose to use the method of compositae for obtaining explicit expression of the coefficients of generating functions). As a result, we also apply this method and develop new ranking and unranking algorithms for the following combinatorial sets: permutations, permutations with ascents, combinations, Dyck paths with return steps, labeled Dyck paths with ascents on return steps. For each of them, we construct an AND/OR tree structure, find a bijection between the elements of the combinatorial set and the set of variants of the AND/OR tree, and develop algorithms for ranking and unranking the variants of the AND/OR tree.

Combinatorial Generation of Nucleobase Libraries by MCR

1997 ◽  
Vol 16 (7-9) ◽  
pp. 1753-1756 ◽  
Author(s):  
Alexander Dömling ◽  
Wolfgang Richter
Keyword(s):  
Combinatorial Generation

Novel Solid-Phase Synthetic Method for Combinatorial Generation of a 4-Hydroxyquinolin-2(1H)-one-Based Library

Synlett ◽  
2007 ◽  
Vol 2007 (9) ◽  
pp. 1431-1435 ◽  
Author(s):  
Young-Dae Gong ◽  
Moon-Kook Jeon ◽  
Hyun La ◽  
Deok-Chan Ha
Keyword(s):  
Solid Phase ◽  
Synthetic Method ◽  
Combinatorial Generation

α-Azidoesters as divergent intermediates for combinatorial generation of glucofuranose libraries of novel N-linked glycopeptides

Tetrahedron ◽  
1996 ◽  
Vol 52 (32) ◽  
pp. 10711-10720 ◽  
Author(s):  
Tilmann W. Brandstetter ◽  
Carmen de la Fuente ◽  
Yong-ha Kim ◽  
Richard I. Cooper ◽  
David J. Watkin ◽  
...  
Keyword(s):  
Combinatorial Generation
Sign in / Sign up

Export Citation Format

Share Document