Reidys, C. M. & P. F. Stadler (2002). Combinatorial landscapes. SIAM Review 44, 3--54.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Computational Chemistry with RNA Secondary Structures - Flamm, Hofacker, Stadler (2003) Self-citation (Stadler) (Correct)
No context found.
C. M. Reidys and P. F. Stadler. Combinatorial landscapes. SIAM Review, 44:3--54, 2002.
Graph Laplacians, Nodal Domains, - And Hyperplane Arrangements Self-citation (Stadler) (Correct)
No context found.
C. M. Reidys and P. F. Stadler. Combinatorial landscapes. SIAM Review, 44:3--54, 2002.
Barrier Trees on Poset-Valued Landscapes - Stadler, Flamm (2002) Self-citation (Stadler) (Correct)
No context found.
Reidys, C. M. and P. F. Stadler: 2002, `Combinatorial Landscapes'. SIAM Review 44, 3--54.
Barrier Trees on Poset-Valued Landscapes - Peter Stadler And Self-citation (Stadler) (Correct)
No context found.
Reidys, C. M. and P. F. Stadler: 2002, `Combinatorial Landscapes'. SIAM Review 44, 3--54.
Molecular Replicator Dynamics - Stadler, Stadler (2002) Self-citation (Stadler) (Correct)
No context found.
Reidys C.M. and Stadler P.F. Combinatorial landscapes. SIAM Review, 44, 3--54 (2002).
Graph Laplacians, Nodal Domains, and Hyperplane.. - Biyikoglu.. (2002) Self-citation (Stadler) (Correct)
.... problems, among them the TSP, graph bi partitioning, and certain spin glass models, are eigenfunctions of graphs associated with search heuristics for these problems [39, 41, 56] This observation was one of the starting points of the algebraic theory of fitness landscapes which is reviewed in [54]. In the latter context the Laplacian eigenvectors of the Boolean Hypercubes (binary Hamming Graphs, iterated cartesian product of K 2 ) are of particular interest. 2. Nodal Domain Theorems Let G(V, E) be a finite, connected, undirected graph, and denote its number of vertices by N = V . For ....
.... to this class of operators [17] Discrete Schrodinger operators and their eigenfuctions are of interest in simplified quantum mechanical models of organic molecules, the so called Huckel model [42] Now consider a function f : V R on G(V, E) Such a function is called a landscape on G in [54]. A strong nodal domain of f is a maximal connected induced subgraph G[W ] of G with vertex set W such that f(x)f(y) 0 for all x, y W . A (weak) nodal domain of f is a maximal connected induced subgraph G[W ] such that f(x)f(y) for all x, y W . A (strong or weak) nodal domain G[W ] is ....
C. M. Reidys and P. F. Stadler. Combinatorial landscapes. SIAM Review, 44:3--54, 2002.
Generalized Topological Spaces in Evolutionary Theory and.. - Stadler, Stadler (2001) (1 citation) Self-citation (Stadler) (Correct)
.... case) and subsequent evaluation of the phenotype (here: structure) For details we refer to the literature, e.g. 8, 9, 10] tial geometry [11, 12] On the other hand in the context of combinatorial optimization and molecular biology an essentially graph theoretical formalism has been developed [13, 14, 15, 16, 17]. The physics of disordered systems is commonly described in the language of statistical mechanics [18] The few examples mentioned in the previous paragraphs emphasize the fact that landscapes have the real valued function f : X R in common, while the structure of the underlying configuration ....
....a constrained stack is a continuous transition, while closing the same stack is not continuous; thus phenotype spaces are typically not symmetric. 6 VALLEYS OF LANDSCAPES Descriptions of fitness landscapes usually contains terms such as local minimum , saddle point , valley , or ruggedness [13, 17]. Many of these concepts have natural topological counterparts. Adaptive walks, for instance, correspond to monotonic continuous functions of the form (X, cl) Below we discuss just two topics in some more detail: local minima and saddle points. We assume throughout this section that (X, cl) ....
Reidys, C. M.; Stadler, P. F., Combinatorial Landscapes. SIAM Review 2001, submitted, SFI preprint 01-03-14.
Landscapes and Effective Fitness - Stadler, Stephens (2003) (2 citations) Self-citation (Stadler) (Correct)
....in this question. Thus, in talking about fitness one must distinguish between individuals and populations, as selective values of genotypes are based on competition among genotypes, but may not adequately reflect their e#ect on the population, such as in the case of altruism. Fitness landscapes [8] have played an important role in improving our understanding of evolutionary dynamics. Given the many di#erent meanings and associated mathematical representations of fitness however, we need to understand exactly which fitness is being represented. Fitness landscapes are by construction a static ....
....to be static, though this is not a restriction. The corresponding fitness landscapes are thus static and hence have been principally studied by focusing on geometric properties such as smoothness, ruggedness, and neutrality. This static point of view has been the main focus of two recent reviews [8, 72], which are complementary to material presented here. Even in this much simplified setting however, there is no complete classification, or taxonomy, of landscapes. On the other hand, interesting and important classes of landscapes, such as the Nk models [70] elementary landscapes [73] which ....
[Article contains additional citation context not shown here]
Reidys, C. M. and Stadler, P. F. Combinatorial landscapes. SIAM Review, 44:3--54, 2002.
The Evolution Of Genetic Representations And Modular Adaptation - Toussaint (2003) (4 citations) (Correct)
No context found.
Reidys, C. M. & P. F. Stadler (2002). Combinatorial landscapes. SIAM Review 44, 3--54.
Topological Interpretation of Crossover - Alberto Moraglio And (2004) (Correct)
No context found.
C. M. Reidys, P. F. Stadler. Combinatorial Landscapes. SIAM Review 44, 3-54, 2002.
Change Profiles - Mielikäinen (Correct)
No context found.
C. M. Reidys and P. F. Stadler. Combinatorial landscapes. SIAM Review, 44(1):3--54, 2002.
On Network Correlated Data Gathering - Azvan Cristescu Baltasar (2004) (7 citations) (Correct)
No context found.
C. Reidys and P. Stadler, "Combinatorial landscapes," SIAM Review, vol. 44, pp. 3--54, 2002.
An Efficient Local Search Method for Random 3-Satisfiability - Seitz, Orponen (Correct)
No context found.
Reidys, C. M. & Stadler, P. F. Combinatorial landscapes. SIAM Review 44, 3-54 (2002).
On Network Correlated Data Gathering - Razvan Cristescu Baltasar (2004) (7 citations) (Correct)
No context found.
C. Reidys and P. Stadler, "Combinatorial landscapes," SIAM Review, vol. 44, pp. 3--54, 2002.
An Efficient Local Search Method for Random 3-Satisfiability - Seitz, Orponen (2003) (Correct)
No context found.
C. M. Reidys and P. F. Stadler, Combinatorial landscapes, SIAM Review 44 (2002) 3-54.
Network Correlated Data Gathering with Explicit.. - Cristescu.. (Correct)
No context found.
C. Reidys and P. Stadler. Combinatorial Landscapes. SIAM Review, 44:3--54, 2002.
Change Profiles - Mielikäinen (Correct)
No context found.
C. M. Reidys and P. F. Stadler. Combinatorial landscapes. SIAM Review, 44(1):3--54, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC