Fast Fourier transform for fitness landscapes

DOI10.1006/acha.2001.0346zbMath1004.92028OpenAlexW1986698865WikidataQ56991730 ScholiaQ56991730MaRDI QIDQ1604498

Peter J. Kostelec, Peter F. Stadler, Wim Hordijk, Daniel N. Rockmore

Publication date: 4 July 2002

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/acha.2001.0346

zbMATH Keywords

fast Fourier transformHamming graphsWalsh transformsRNA folding

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of graph theory (05C90) Representations of finite symmetric groups (20C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Protein sequences, DNA sequences (92D20) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items

A unified FFT-based approach to maximum assignment problems related to transitive finite group actions, Rugged and Elementary Landscapes, A noncommutative approach to the graphon Fourier transform, Optimisation via encodings: a renormalisation group perspective, Fundamental weight systems are quantum states, Application of graph-theoretic approaches to the random landscapes of the three-dimensional assignment problem, Graphically abelian groups, A New Property of Hamming Graphs and Mesh of d-ary Trees, Cover-encodings of fitness landscapes, Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\), Signal processing on the permutahedron: tight spectral frames for ranked data analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• RNA secondary structures and their prediction
• RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
• Spectral properties of Eigen evolution matrices
• Evolution on sequence space and tensor products of representation spaces
• Perron-Frobenius type results and discrete versions of nodal domain theorems
• Local search and the local structure of NP-complete problems
• Spectra of graphs with transitive groups
• Some geometric aspects of graphs and their eigenfunctions
• A generalization of spectral analysis with application to ranked data
• Combinatorics of RNA secondary structures
• Generic properties of combinatory maps: Neutral networks of RNA secondary structures
• Quasi-abelian Cayley graphs and Parsons graphs
• Random induced subgraphs of generalized \(n\)-cubes
• On adjacency-transitive graphs
• Landscapes and their correlation functions
• The Laplacian Spectrum of a Graph
• Amplitude Spectra of Fitness Landscapes
• Landscapes: Complex optimization problems and biopolymer structures
• The Generalized Walsh Functions