- 1
-
D. Gusfield.
Algorithms on Strings, Trees, and Sequences: Computer Science
and Computational Biology.
Cambridge University Press, Cambridge, 1997.
- 2
-
B. Haubold, J. Kroymann, A. Ratzka, T. Mitchell-Olds, and T. Wiehe.
Recombination and gene conversion in Arabidopsis thaliana.
Genetics, 161:1269-1278, 2002.
- 3
-
B. Haubold, N. Pierstorff, F. Möller, and T. Wiehe.
Genome comparison without alignment using shortest unique substrings.
BMC Bioinformatics, 6:123, 2005.
- 4
-
B. Haubold and T. Wiehe.
Calculating the SNP-effective sample size from an alignment.
Bioinformatics, 18:36-38, 2002.
- 5
-
B. Haubold and T. Wiehe.
How repetitive are genomes?
BMC Bioinformatics, 7:541, 2006.
- 6
-
R. R. Hudson.
Properties of a neutral allele model with intragenic recombination.
Theoretical Population Biology, 23:183-201, 1983.
- 7
-
J. F. C. Kingman.
The coalescent.
Stochastic Processes and their Applications, 13:235-248, 1982.
- 8
-
P. Pfaffelhuber, B. Haubold, and A. Wakolbinger.
Approximate genealogies under genetic hitchhiking.
Genetics, 174:1995-2008, 2006.
- 9
-
The International SNP Map Working Group.
A map of human genome sequence variation containing 1.42 million
single nucleotide polymorphisms.
Nature, 409:928-933, 2001.
- 10
-
E. Ukkonen.
On-line construction of suffix-trees.
Algorithmica, 14:249-260, 1995.
- 11
-
G. A. Watterson.
On the number of segregating sites in genetical models without
recombination.
Theoretical Population Biology, 7:256-276, 1975.
