Global Information Lookup Global Information

Longest linear sequence information


In synthetic chemistry, the longest linear sequence, commonly abbreviated as LLS, is the largest number of reactions required to go from the starting materials to the products in a multistep sequence.[1]

This concept is very important when trying to optimize a synthetic plan. Since every reaction step can decrease the yield of the product, reducing the value of the LLS is a good way to increase the quantity of chemicals formed at the end: this can be done by devising quicker methods to couple the fragments or by introducing convergence.[2] However, improving sequences which are not the longest linear one will generally not produce an overall enhancement to the yield of the reaction since the benefits incur in intermediates that were already present in excess, assuming that the yields for each of the steps are roughly equal.

  1. ^ Carey, Francis; Sundberg, Richard (2007). Advanced Organic Chemistry: Part B: Reaction and Synthesis. Springer. p. 1165. ISBN 9780387683546.
  2. ^ Warren, Stuart; Wyatt, Paul (2011). Organic Synthesis: The Disconnection Approach. John Wiley & Sons. ISBN 9781119965534.

and 26 Related for: Longest linear sequence information

Request time (Page generated in 0.836 seconds.)

Longest linear sequence

Last Update:

In synthetic chemistry, the longest linear sequence, commonly abbreviated as LLS, is the largest number of reactions required to go from the starting...

Word Count : 173

LLS

Last Update:

type of crude oil Linear least squares Lithuanian Freedom Union (Liberals), a political party in Lithuania Longest linear sequence, a concept in synthetic...

Word Count : 175

Discodermolide

Last Update:

synthesis of (-)-discodermolide has an overall yield of 3.2% with a longest linear sequence of 24 steps and 36 total steps. In 1996, the Schreiber group published...

Word Count : 3454

Strychnine total synthesis

Last Update:

same reaction. In 2011, the Vanderwal group reported a concise, longest linear sequence of 6 steps, total synthesis of strychnine. It featured a Zincke...

Word Count : 4087

Longest common subsequence

Last Update:

A longest common subsequence (LCS) is the longest subsequence common to all sequences in a set of sequences (often just two sequences). It differs from...

Word Count : 4253

Linear recurrence with constant coefficients

Last Update:

values of the elements of a sequence. The polynomial's linearity means that each of its terms has degree 0 or 1. A linear recurrence denotes the evolution...

Word Count : 4667

Spaghetti sort

Last Update:

Spaghetti sort is a linear-time, analog algorithm for sorting a sequence of items, introduced by A. K. Dewdney in his Scientific American column. This...

Word Count : 387

List of algorithms

Last Update:

class Samplesort Longest common subsequence problem: Find the longest subsequence common to all sequences in a set of sequences Longest increasing subsequence...

Word Count : 7843

Okadaic acid

Last Update:

with the A fragment. This synthesis contained 106 steps, with a longest linear sequence of 54 steps. The precursors to all three fragments were all glucose...

Word Count : 2307

Longest palindromic substring

Last Update:

finding the longest palindromic substring in linear time. Akalin, Fred (2007-11-28), Finding the longest palindromic substring in linear time, retrieved...

Word Count : 2189

Longest path problem

Last Update:

no negative cycles can be created, and a longest path in G can be found in linear time by applying a linear time algorithm for shortest paths in −G, which...

Word Count : 2662

Linear probing

Last Update:

probability, the longest probe sequence (among the probe sequences for all keys stored in the table) has logarithmic length. Linear probing hash tables...

Word Count : 3605

Zincke aldehyde

Last Update:

C.; Vanderwal, C. D. (2011). "A Synthesis of Strychnine by a Longest Linear Sequence of Six Steps". Chem. Sci. 2 (4): 649. doi:10.1039/C1SC00009H. Nuhant...

Word Count : 982

Genome

Last Update:

nucleotides of DNA, divided into 24 linear molecules, the shortest 45 000 000 nucleotides in length and the longest 248 000 000 nucleotides, each contained...

Word Count : 7228

Palindrome

Last Update:

read completely. It is possible to find the longest palindromic substring of a given input string in linear time. The palindromic density of an infinite...

Word Count : 4987

Topological sorting

Last Update:

Topological sorting forms the basis of linear-time algorithms for finding the critical path of the project, a sequence of milestones and tasks that controls...

Word Count : 3176

Split gene theory

Last Update:

in random sequence). The genome sequences of living organisms exhibit exactly the same average lengths of 120 bases for exons, and the longest exons of...

Word Count : 8031

Patience sorting

Last Update:

storage, creation and traversal require linear time and space). They further show how to report all the longest increasing subsequences from the same resulting...

Word Count : 1127

Sequence alignment

Last Update:

the longest subsequence that occurs in both query sequences. Longer MUM sequences typically reflect closer relatedness. in the multiple sequence alignment...

Word Count : 6899

Alkane

Last Update:

can be linear, branched, or cyclic. The third group is sometimes called cycloalkanes. Very complicated structures are possible by combining linear, branch...

Word Count : 5928

Directed acyclic graph

Last Update:

example, it is possible to find shortest paths and longest paths from a given starting vertex in DAGs in linear time by processing the vertices in a topological...

Word Count : 5628

Suffix tree

Last Update:

expression pattern. Suffix trees also provided one of the first linear-time solutions for the longest common substring problem. These speedups come at a cost:...

Word Count : 3691

Cytomegalovirus

Last Update:

hundred bps, the so-called "a sequence"; the other regions of the repeats are sometimes referred to as "b sequence" and "c sequence". Viral replication is nuclear...

Word Count : 1369

Lowest common ancestor

Last Update:

answered in constant time. Hence, case 1 can be answered in linear space and constant time. The sequence of RMQ that reduced from LCA has one property that a...

Word Count : 2991

Edit distance

Last Update:

solving such recurrences and extracting an optimal sequence of operations cache-efficiently in space linear in the size of the input is given by Chowdhury...

Word Count : 2504

Hash table

Last Update:

found, which indicates an unsuccessful search. Well-known probe sequences include: Linear probing, in which the interval between probes is fixed (usually...

Word Count : 5937

PDF Search Engine © AllGlobal.net