Biology Reference
In-Depth Information
9. Barry D, Hartigan JA (1987) Asynchronous
distance
24. Hannenhalli S, Pevzner PA (1995) Towards a
computational theory of genome rearrange-
ments. Lect Notes Comput Sci 1000:184-202
25. Kececioglu J, Sankoff D (1995) Exact and
approximation algorithms for sorting by rever-
sals, with application to genome rearrange-
ment. Algorithmica 13:180-210
26. Kececioglu J, Gusfield D (1998) Reconstruct-
ing a history of recombinations from a set of
sequences. Discrete Appl Math 88:239-260
27. Kececioglu J, Ravi R (1995) Of mice and men:
algorithms for evolutionary distances between
genomes with translocation. In: Proceedings of
the 6th ACM-SIAM symposium on discrete
algorithms, Society for Industrial and Applied
Mathematics,
between
homologous
DNA
sequences. Biometrics 43:261-276
10. Kishino H, Hasegawa M (1989) Evaluation of
the maximum likelihood estimate of the evolu-
tionary tree topologies from DNA sequence
data, and the branching order in Hominoidea.
J Mol Evol 29:170-179
11. Lake JA (1994) Reconstructing evolutionary
trees from DNA and protein sequences: para-
linear distances. Proc Natl Acad Sci USA
91:1455-1459
12. Camin JH, Sokal RR (1965) A method for
deducing branching sequences in phylogeny.
Evolution 19:311-326
13. Cavalli-Sforza LL, Edwards AWF (1967) Phy-
logenetic analysis: models and estimation pro-
cedures. Evolution 21:550-570
14. Fitch WM (1971) Toward defining the course
of evolution: minimum change for a specific
tree topology. Syst Zool 20:406-416
15. Adachi J, Hasegawa M (1996) MOLPHY ver-
sion 2.3: programs for molecular phylogenetics
based on maximum likelihood. Number 28 in
computer science monographs. Institute of
Statistical Mathematics, Tokyo
16. Guindon S, Gascuel O (2003) A simple, fast,
and accurate algorithm to estimate large phy-
logenies by maximum likelihood. Syst Biol
52:696-704
17. Felsenstein J (1981) Evolutionary trees from
DNA sequences: a maximum likelihood
approach. J Mol Evol 17:368-376
18. Felsenstein J (1989) PHYLIP—phylogeny
inference package (version 3.2). Cladistics
5:164-166
19. Swofford DL (1998) PAUP: phylogenetic
analysis using parsimony (*and other meth-
ods). Sinauer Associates, Sunderland
20. Sankoff D, Leduc G, Antoine N, Paquin B,
Lang BF, Cedergren R (1992) Gene order
comparisons for phylogenetic inference: evolu-
tion of the mitochondrial genome. Proc Natl
Acad Sci USA 89:6575-6579
21. Gramm J, Niedermeier R (2002) Breakpoint
medians and breakpoint phylogenies: a fixed-
parameter approach. Bioinformatics 18(Suppl
2):S128-S139
22. Lin Y, Rajan V, Swenson KM, Moret BME
(2010) Estimating true evolutionary distances
under rearrangements, duplications, and
losses. BMC Bioinformatics 11(Suppl 1):1-11
23. Moret BME, Tang J, Wang L, Warnow T
(2002) Steps toward accurate reconstructions
of phylogenies from gene-order data. J Com-
put Syst Sci 65:508-525
Philadelphia,
PA,
USA,
pp 604-613
28. Boore JL, Brown WM (1998) Big trees from
little genomes: mitochondrial gene order as a
phylogenetic tool. Curr Opin Genet Dev
8:668-674
29. Sankoff D, Blanchette M (1998) Multiple
genome rearrangement and breakpoint phy-
logeny. J Comput Biol 5:555-570
30. Sankoff D (1999) Genome rearrangement with
gene families. Bioinformatics 15:909-917
31. Otu HH, Sayood K (2003) A new sequence
distance measure for phylogenetic tree con-
struction. Bioinformatics 19:2122-2130
32. Bastola DR, Otu HH, Doukas SE, Sayood K,
Hinrichs SH, Iwen PC (2004) Utilization of
the relative complexity measure to construct a
phylogenetic
tree
for
fungi. Mycol Res
108:117-125
33. Russell DJ, Otu HH, Sayood K (2008)
Grammar-based distance in progressive multiple
sequence
alignment. BMC Bioinformatics
9:1-13
34. Russell DJ, Way SF, Benson AK, Sayood K
(2010) A grammar-based distance metric
enables fast and accurate clustering of large sets
of 16S sequences. BMC Bioinformatics 11:1-14
35. Boutros R, Stokes N, Bekaert M, Teeling EC
(2009) UniPrime2: a web service providing
easier universal primer design. Nucleic Acids
Res 37(Web Server issue):W209-W213
36. Albayrak A, Otu HH, Sezerman UO (2010)
Clustering of protein families into functional
subtypes using relative complexity measure
with reduced amino acid alphabets. BMC Bio-
informatics 11:1-10
37. Li M, Vitanyi P (1997) An introduction to
Kolmogorov complexity and its applications.
Springer, Berlin
38. Lempel A, Ziv J (1976) On the complexity of
finite sequences.
IEEE Trans
Inf Theory
22:75-81
