Fast Fourier Transform for Fitness Landscapes

@inproceedings{Rockmore2002FastFT,
  title={Fast Fourier Transform for Fitness Landscapes},
  author={Daniel N. Rockmore and Peter J. Kostelec and Wim Hordijk and Peter F. Stadler},
  year={2002}
}
We cast some classes of fitness landscapes as problems in spectral analysis on various Cayley graphs. In particular, landscapes derived from RNA folding are realized on Hamming graphs and analyzed in terms of Walsh transforms; assignment problems are interpreted as functions on the symmetric group and analyzed in terms of the representation theory of Sn. We show that explicit computations of the Walsh/Fourier transforms are feasible for landscapes with up to 108 configurations using Fast… CONTINUE READING

Figures and Tables from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 23 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 41 REFERENCES

Distances In Random Induced Subgraphs Of Generalized N-Cubes

  • Combinatorics, Probability & Computing
  • 2002
VIEW 1 EXCERPT

Equitable partitions

P. F. Stadler, G. Tinhofer
  • coherent algebras and random walks: Applications to the correlation structure of landscapes. MATCH, 40:215–261
  • 1999
VIEW 1 EXCERPT

Equitable partitions , coherent algebras and random walks : Applications to the correlation structure of landscapes

D. K. Maslen, D. N. Rockmore
  • MATCH
  • 1999

Amplitude Spectra of Fitness Landscapes

  • Advances in Complex Systems
  • 1998
VIEW 3 EXCERPTS

On adjacency-transitive graphs

  • Discrete Mathematics
  • 1998
VIEW 1 EXCERPT