摘要 We cast some classes of 適應度景觀s as problems of spe

本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。

原文連結

• SFI 頁面

論文資訊

• 類型：已發表論文
• 日期：2002

摘要

We cast some classes of 適應度景觀s as problems of 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 S-n. We show that explicit computation of the Walsh/Fourier transforms is feasible for landscapes with up to 108 configurations using fast Fourier transform techniques. We find that the cost function of a linear sum assignment problem involves only the defining representation of the symmetric group, while quadratic assignment problems are superpositions of the representations indexed by the partitions (n). (n - 1, 1), (n - 2, 2), and (n - 2. 1, 1). These

※ 此為已發表論文，全文需透過期刊付費取得