You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
8.8 Bibliographic Notes and Further Reading 165<br />
empirical study of Pearson [159] illustrates that scaling similarity scores by the logarithm<br />
of the size of the database can dramatically improve the performance of a<br />
scoring matrix.<br />
8.5<br />
The method discussed in this section is from the paper of Yu and Altschul [212].<br />
An improved method is given in the paper of Altschul et al. [9].<br />
8.6<br />
This section is written based on the paper of States, Gish, and Altschul [184].<br />
The Henikoff and Henikoff method was used to construct scoring matrix for aligning<br />
non-coding genomic sequences in the paper of Chiaromonte, Yap, and Miller<br />
[45] (see also [46]). More methods for nucleotide scoring matrix can be found in<br />
the papers of Müller, Spang, and Vingron [148] and Schwartz et al. [178]. The transition<br />
and transversion rate is given in the paper of Li, Wu, and Luo [126].<br />
8.7<br />
The affine gap cost was first proposed by Smith and Waterman [180]. The generalized<br />
affine gap cost discussed in this section is due to Altschul [1]. When c = 2b,<br />
the generalized affine gap cost reduces to a cost model proposed by Zuker and Somorjal<br />
for protein structural alignment [217]. The empirical study of Zachariah et<br />
al. [213] shows that the generalized affine gap model allows fewer residue pairs<br />
aligned than the affine gap model but achieves significantly higher per-residue accuracy.<br />
The empirical studies on the distribution of insertions/deletions are found in<br />
the papers of Benner, Cohen, and Gonnet [26] and Pascarella and Argos [158].