Muster und Alignments in zufälligen Zeichenketten - Abteilung für ...

92 Literaturverzeichnis
[85] Siegmund, David und Yakir, Benjamin: Correction: Approximate p-
values for local sequence alignments. The Annals of Statistics, Band 31,
Seite 1027–1031, 2003.
[86] Spang, Rainer und Vingron, Martin: Limits of homology detection by
pairwise sequence comparison. Bioinformatics, Band 17, Seite 338–342, 2001.
[87] Steele, J. Michael: Long common subsequence and the proximity of two
random strings. SIAM Journal of Applied Mathematics, Band 42, Seite
731–736, 1982.
[88] Stefanov, Valeri T.: The intersite distances between pattern occurences
in strings generated by general discrete- and continuous-time models: An
algorithmic approach. Journal of Applied Probability, Band 40, Seite 881–
892, 2003.
[89] Stein, Charles: A bound for the error in the normal approximation to the
distribution of a sum of dependent random variables. In: LeCam, Lucien
M.; Neyman, Jerzy und Scott, Elizabeth L. (Herausgeber): Proceedings
of the sixth Berkeley Symposium on Mathematical Statistics and
Probability, Band II, Seite 583–602. University of California Press, 1970.
[90] Szpankowski, Wojciech: Average Case Analysis of Algorithms on Sequences.
John Wiley & Sons, 2000.
[91] Szpankowski, Wojciech: New and old problems in pattern matching: Limited
(and personal) survey. Vortrag zum Seventh International Seminar on
the Analysis of Algorithms, Tatihou, France, Juni 2001.
[92] Vallée, Brigitte: Dynamical sources in information theory: fundamental
intervals and word prefixes. Algorithmica, Band 29, Seite 262–306, 2001.
[93] Varadhan, S. R. Srinivasa: Large Deviations and Applications. SIAM,
1984.
[94] Waterman, Michael S.: Introduction to Computational Biology. Chapman
& Hall, 1995. Reprint 1996.
[95] Watson, James D. und Crick, Francis H. C.: A structure for deoxyribose
nucleic acid. Nature, Band 171, Seite 737–738, 1953.