Combinatorial landscapes

SIAM Review

Volumn 44, Issue 1, 2002, Pages 3-54

  Reidys, Christian M ^a   Stadler, Peter F ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

Coherent algebras; Combinatorial optimization; Correlation functions; Fitness landscape; Genotype phenotype map; Neutrality; Random graphs; Sequential dynamical systems

Indexed keywords

ALGEBRA; CONFORMAL MAPPING; FUNCTIONS; NUMBER THEORY; OPTIMIZATION;

COHERENT ALGEBRAS; COMBINATORIAL LANDSCAPES; COMBINATORIAL OPTIMIZATION; CORRELATION FUNCTIONS; FITNESS LANDSCAPE; GENOTYPE PHENOTYPE MAP; NEUTRALITY; RANDOM GRAPHS; SEQUENTIAL DYNAMICAL SYSTEMS;

COMBINATORIAL MATHEMATICS;

EID: 0036494672     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0036144501395952     Document Type: Review

References (253)

1. Largest random component of a k-cube
2. The schema theorem and the price's theorem
3. Error threshold in finite populations
4. Autocorrelation coefficient for the graph bipartitioning problem
5. On the quality of local search for the quadratic assignment problem
6. On the classification of NP-complete problems in terms of their correlation coefficient
7. Ruggedness and neutrality-the N Kp family of fitness landscapes
8. Elements of a theory of simulation II: Sequential dynamical systems
9. Elements of a theory of simulation III: Sequential dynamical systems
10. Elements of a theory of simulation IV: Sequential dynamical systems
11. Elements of a theory of simulation I: Sequential CA over random graphs
12. Landscapes on spaces of trees
13. The topology of multidimensional potential energy surfaces: Theory and application to peptide structure and kinetics
14. Spin glasses: Experimental facts, theoretical concepts, and open questions
15. RNA multi-structure landscapes. A study based on temperature dependent partition functions
16. Metastable states in spin glasses with short-ranged interactions
17. Linear assignment problems and extensions
18. Finite-size scaling of the error threshold transition in finite population
19. Rough large deviation estimates for simulated annealing: Application to exponential schedules
20. Simulated annealing algorithms and Markov chains with rate transitions
21. Self-splicing RNA: Implications for evolution
22. RNA as an enzyme
23. Sequence space soup
24. Spectral graph theory
25. Mutation-crossover isomorphism and the construction of discriminating functions
26. Evolving globally synchronized cellular automata
27. Discrete nodal domain theorems
28. Convergence, closure, and neighborhoods
29. Metastable states in high order short-range spin glasses
30. Multiplicités des valeurs propres Laplaciens discrete at Laplaciens continus
31. Metastable states of a spin glass chain at 0 temperature
32. Evolution in a flat fitness landscape
33. Principles of protein folding: A perspective from simple exact models
34. Evolution of the potential energy surface with size for Lennard-Jones clusters
35. Perron-Frobenius type results and discrete versions of nodal domain theorems
36. Selforganization of matter and the evolution of biological macromolecules
37. The molecular quasispecies
38. Aptamers achieve the desired recognition
39. In vitro selection of RNA molecules that bind specific ligands
40. On the evolution of random graphs
41. Cellular rings and groups of automorphisms of graphs
42. The logical basis of phylogenetic analysis
43. Evolutionary trees from DNA sequences: A maximum likelihood approach
44. Landscape statistics of the low autocorrelated binary string problem
45. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory
46. Non-binary transformations of genetic algorithms
47. The generalized Walsh functions
48. Limesräume
49. RNA folding kinetics at elementary step resolution
50. Design of multi-stable RNA molecules
51. RNA in silico: The computational biology of RNA secondary structures
52. Barrier trees of degenerate landscapes
53. Evolution in a rugged fitness landscape
54. Physical aspects of evolutionary optimization and adaption
55. A computer model of evolutionary optimization
56. Continuity in evolution: On the nature of transitions
57. RNA folding and combinatory landscapes
58. Morse theory for cell complexes
59. Witten-morse theory for cell complexes
60. Morse theory and evasiveness
61. Relative building block fitness and the building block hypothesis
62. Interdependecies, nearly-decomposability, and adaptation
63. Some geometric aspects of graphs and their eigenfunctions
64. Correlation length, isotropy, and meta-stable states
65. Efficiency of local search with multiple local optima
66. Energy landscapes, supergraphs, and "folding funnels" in spin systems
67. Molecular evolution over the mutational landscape
68. Recombination induced hypergraphs: A new approach to mutation-recombination isomorphism
69. On extended topologies. I: Closure operators
70. Structural constraints and neutrality in RNA
71. Genetic algorithms and walsh functions. Part I: A gentle introduction
72. Genetic algorithms and walsh functions. Part II: Deceptiveness and its analysis
73. Genetic algorithms and the variance of fitness
74. The simplest spin glass
75. Local search and the local structure of NP-complete problems
76. Analysis of RNA sequence structure maps by exhaustive enumeration. I. Neutral networks
77. Analysis of RNA sequence structure maps by exhaustive enumeration. II. Structure of neutral networks and shape space covering
78. Fifty years of the Wiener index
79. Cooling schedules for optimal annealing
80. Extended topology: Set-valued set functions
81. Modelling genetic architecture: A multilinear theory of gene interaction
82. A note on the edges on the n-cube
83. RNA structures with pseudo-knots: Graph-theoretical and combinatorial properties
84. Intersection matrices for finite permutation groups
85. Coherent configurations. I: Ordinary representation theory
86. Coherent configurations. II: Weights
87. Combinatorics of RNA secondary structures
88. Genetic algorithms and classifier systems: Foundations and future directions
89. A measure of landscapes
90. Correlation analysis of the synchronizing-CA landscape
91. Amplitude spectra of fitness landscapes
92. Analysis of a complex of statistical variables into principal components
93. Computation of generating functions for biological molecules
94. Exploring phenotype space through neutral evolution
95. Smoothness within ruggedness: The role of neutrality in adaptation
96. Fitness distance correlation as a measure of problem difficulty for genetic algorithms
97. Directed molecular evolution
98. Zur Spektraltheorie Stochasticher Prozesse
99. Towards a general theory of adaptive walks on rugged landscapes
100. Convergence functions and their related topologies
101. A note on pretopologies
102. On the depth of combinatorial optimization problems
103. Optimization by simulated annealing
104. Partial orderings in chemistry
105. Algebraic combinatorics in mathematical chemistry. Methods and algorithms. I. Permutation groups and coherent (cellular) algrebras
106. All you wanted to know about SELEX
107. Adaptive parties in spatial elections
108. Neutral networks: A combinatorial perspective
109. QSAR: Hansch analysis and related approaches
110. Genetic algorithms for the travelling salesman problem: A review of representations and operators
111. Adaptation on rugged landscapes
112. Deceptiveness and genetic algorithm dynamics
113. Polynomials, basis sets, and deceptiveness in genetic algorithms
114. Exact solution of large asymmetric traveling salesman problems
115. Ramdom walks on graphs: A survey
116. Evolutionary walks on rugged landscapes
117. Protein evolution on rugged landscape
118. Dynamics in Eigen quasispecies model
119. Generalized FFTs-a survey of some recent results
120. A survey of graph Laplacians
121. Fitness landscape analysis and memetic algorithms for the quadratic assignment problem
122. An extracellular Darwinian experiment with a self-duplicating nucleic acid molecule
123. The Laplacian spectrum of graphs
124. Some applications of Laplace eigenvalues of graphs
125. Random processes in genetics
126. Barrier heights between groundstates in a model of RNA secondary structure
127. Discrete, sequential dynamical systems
128. A comparison of predictive measures of problem difficulty in evolutionary algorithms
129. Metastable states of the SK spin glass model
130. Molecular modeling of proteins and mathematical prediction of protein structure
131. Effects of selective neutrality on the evolution of molecular species
132. Adaptive walks through fitness landscapes for early vascular land plants
133. A Markov chain analysis on a simple genetic algorithm
134. Error thresholds of replication in finite populations, mutation frequencies and the onset of Muller's ratchet
135. The energy landscape theory of protein folding: Insights into folding mechanisms and scenarios
136. Walsh functions, scheme variance, and deception
137. Optimization on rugged landscapes
138. Protein evolution on partially correlated landscapes
139. Graph partitioning by eigenvectors
140. Ultrametricity for physicists
141. Random induced subgraphs of generalized n-cubes
142. Acyclic orientations of random graphs
143. Random graphs and sequence to structure maps
144. Random structures
145. Acyclic orientations and sequential dynamical systems
146. Replication and mutation on neutral networks of RNA secondary structures
147. Bio-molecular shapes and algebraic structures
148. Neutrality in fitness landscapes
149. Generic properties of combinatory maps: Neural networks of RNA secondary structures
150. The number of solutions of the Thouless-Anderson-Palmer equations for p-spin interaction spin glasses
151. Some applications of generalized FFTs
152. Fast fourier transform for fitness landscapes
153. On the foundations of combinatorial theory I: Theory of Möbius functions
154. Finite markov chain results in evolutionary computation: A tour d'horizon
155. The depth and width of local minima in discrete solution spaces
156. An RNA motif that binds ATP
157. Plane trees and RNA secondary structure
158. One sequence, two ribozymes: Implications for the emergence of new ribozyme folds
159. Landscapes and molecular evolution
160. From sequences to shapes and back: A case study in RNA secondary structures
161. Landscapes: Complex optimization problems and biopolymer structures
162. Stationary mutant distributions and evolutionary optimization
163. Asymmetry of configuration spaces induced by unequal crossover: Implications for a mathematical theory of evolutionary innovation
164. Combinatorial optimization, simulated annealing, and fractals
165. Adaptive platform dynamics in multi-party spatial voting
166. Generalized topological spaces in evolutionary theory and combinatorial chemistry
167. The topology of the possible: Formal spaces underlying patterns of evolutionary change
168. Random walks and orthogonal functions associated with highly symmetric graphs
169. Towards a theory of landscapes
170. Landscapes and their correlation functions
171. Fitness landscapes arising from the sequence-structure maps of biopolymers
172. Fitness landscapes
173. Spectral landscape theory
174. Correlation structure of the landscape of the graph-bipartitioning-problem
175. Random field models for fitness landscapes
176. Local minima of p-spin models
177. The landscape of the travelling salesman problem
178. Population dependent Fourier decomposition of fitness landscapes over recombination spaces: Evolvability of complex characters
179. Equitable partitions, coherent algebras and random walks: Applications to the correlation structure of landscapes
180. The algebraic theory of recombination spaces
181. Acyclic orientations of graphs
182. Effective degrees of freedom in genetic algorithms
183. Self-replication with errors-a model for polynucleotide replication
184. Algorithm independent properties of RNA structure prediction
185. Analytic theory of the ground state properties of a spin glass: I. Ising spin glass
186. Error-thresholds for molecular quasi-species as phase transitions: From simple landscapes to spinglass models
187. Solution of "solvable model of a spin glass"
188. Systematic evolution of ligands by exponential enrichment: RNA ligands to bacteriophage T4 DNA polymerase
189. Metastable evolutionary dynamics: Crossing fitness barriers or escaping via neutral paths
190. On the nature of two-bit multiplier landscapes
191. Energy barriers in SK spin glass models
192. The simple genetic algorithm and the Walsh transform. Part I: Theory
193. The simple genetic algorithm and the Walsh transform. Part II: The inverse
194. What is the difference between models of error thresholds and Muller's ratchet?
195. Complex adaptations and the structure of recombination spaces
196. Energy landscapes: From clusters to biomolecules
197. Archetypal energy landscapes
198. Quasi-abelian Cayley graphs and Parsons graphs
199. Combinatorics of RNA hairpins and cloverleaves
200. Correlated and uncorrelated fitness landscapes and how to tell the difference
201. Fourier and Taylor series on fitness landscapes
202. Local properties of Kauffman's N-k model: A tunably rugged energy landscape
203. Reduction of a graph to a canonical form and an algebra arising during this reduction
204. Polyribonucleic acids as enzymes
205. Fundamental principles of deception in genetic search
206. Model dependency of error thresholds: The role of fitness functions and contrasts between the finite and infinite sites models
207. Adaptive evolution on neutral networks
208. Population evolution on a multiplicative single-peak fitness landscape
209. The roles of mutation, inbreeding, crossbreeding and selection in evolution
210. "Surfaces" of selective value
211. On adjacency-transitive graphs