-
1
-
-
0000773502
-
Trees, stars, and multiple sequence afignment
-
S. Altschul and D. Lipman, Trees, stars, and multiple sequence afignment, SIAM Journal on Applied Math., 49 (1989), pp. 197-209.
-
(1989)
SIAM Journal on Applied Math.
, vol.49
, pp. 197-209
-
-
Altschul, S.1
Lipman, D.2
-
2
-
-
0030783392
-
On distances between phylogenetic trees
-
Jan., New Orleaxm
-
B. DasGupta, X. He, T. Jiang, M. Li, J. Tromp and L. Zhang, On distances between phylogenetic trees, Proc. 8th Annual A CM-SIAM Symposium on Discrete Algorithms, Jan. 1997, New Orleaxm.
-
(1997)
Proc. 8th Annual A CM-SIAM Symposium on Discrete Algorithms
-
-
Dasgupta, B.1
He, X.2
Jiang, T.3
Li, M.4
Tromp, J.5
Zhang, L.6
-
3
-
-
84877326802
-
On the linear-cost subtreetransfer distance
-
B. DasGupta, X. He, T. Jiang, M. Li, and J. Tromp, On the linear-cost subtreetransfer distance, submitted to Algorithmica, 1997.
-
(1997)
Algorithmica
-
-
Dasgupta, B.1
He, X.2
Jiang, T.3
Li, M.4
Tromp, J.5
-
4
-
-
0024641218
-
Speeding up dynamic programming with applications to molecular biology
-
Z. Galil and R. Ciancarlo, "Speeding up dynamic programming with applications to molecular biology", Theoretical Computer Science 64, pp. 107-118, 1989.
-
(1989)
Theoretical Computer Science
, vol.64
, pp. 107-118
-
-
Galil, Z.1
Ciancarlo, R.2
-
6
-
-
0024766957
-
A new method that simultaneously aligns and reconstructs ancestral sequences for any number of homologous sequences, when the phylogeny is given
-
J. Hein, A new method that simultaneously aligns and reconstructs ancestral sequences for any number of homologous sequences, when the phylogeny is given, Mol. Biol. Evol. 6 (1989), 649-668.
-
(1989)
Mol. Biol. Evol.
, vol.6
, pp. 649-668
-
-
Hein, J.1
-
7
-
-
0025299784
-
Reconstructing evolution of sequences subject to recombination using parsimony
-
J. Hein, Reconstructing evolution of sequences subject to recombination using parsimony, Math. Biosci. 98(1990), 185-200.
-
(1990)
Math. Biosci.
, vol.98
, pp. 185-200
-
-
Hein, J.1
-
8
-
-
0027471670
-
A heuristic method to reconstruct the history of sequences subject to recombination
-
J. Hein, A heuristic method to reconstruct the history of sequences subject to recombination, J. Mol. Evo. 36(1993) 396-405.
-
(1993)
J. Mol. Evo.
, vol.36
, pp. 396-405
-
-
Hein, J.1
-
9
-
-
0002291589
-
On the complexity of comparing evolutionary trees
-
J. Hein, T. Jiang, L. Wang, and K. Zhang, On the complexity of comparing evolutionary trees, Discrete Applied Mathematics, 71(1996), 153-169.
-
(1996)
Discrete Applied Mathematics
, vol.71
, pp. 153-169
-
-
Hein, J.1
Jiang, T.2
Wang, L.3
Zhang, K.4
-
11
-
-
84877315482
-
An algorithm for locating non-overlapping regions of maximum alignment score
-
S. K. Kannan and E. W. Myers, "An algorithm for locating non-overlapping regions of maximum alignment score", CPM93, pp. 74-86, 1993.
-
(1993)
CPM93
, pp. 74-86
-
-
Kannan, S.K.1
Myers, E.W.2
-
12
-
-
0028317748
-
Reconstructing a history of recombinations from a set of sequences
-
Arlington, Virginia, January
-
J. Kececioglu and D. Gusfietd, " Reconstructing a history of recombinations from a set of sequences", 5th Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, Virginia, pp. 471-480, January 1994
-
(1994)
5th Annual ACM-SIAM Symposium on Discrete Algorithms
, pp. 471-480
-
-
Kececioglu, J.1
Gusfietd, D.2
-
13
-
-
34748868569
-
An algorithm for approximate tandem repeats
-
G. M. Landau and J. P. Schmidt, "An algorithm for approximate tandem repeats, CPM'93, pp. 120-133, 1993.
-
(1993)
CPM'93
, pp. 120-133
-
-
Landau, G.M.1
Schmidt, J.P.2
-
14
-
-
0016424695
-
Minimal mutation trees of sequences
-
D. Sankoff, Minimal mutation trees of sequences, SIAM J. Applied Math. 28(1975), 35-42.
-
(1975)
SIAM J. Applied Math.
, vol.28
, pp. 35-42
-
-
Sankoff, D.1
-
15
-
-
0017293845
-
Frequency of insertion-deletion, transversion, and transition in the evolution of 5S ribosomal RNA
-
D. Sankoff, R. J. Cedergren and G. Lapalme, Frequency of insertion-deletion, transversion, and transition in the evolution of 5S ribosomal RNA, J. Mol. Evol. 7(1976), 133-149.
-
(1976)
J. Mol. Evol.
, vol.7
, pp. 133-149
-
-
Sankoff, D.1
Cedergren, R.J.2
Lapalme, G.3
-
16
-
-
0001213953
-
Simultaneous comparisons of three or more sequences related by a tree
-
D. Sankoff and J. Kruskal, editors, Addison Wesley
-
D. Sankoff and R. Cedergren, Simultaneous comparisons of three or more sequences related by a tree, In D. Sankoff and J. Kruskal, editors, Time warps, string edits, and maeromolecules: the theory and practice of sequence comparison, pp. 253-264, Addison Wesley, 1983.
-
(1983)
Time Warps, String Edits, and Maeromolecules: The Theory and Practice of Sequence Comparison
, pp. 253-264
-
-
Sankoff, D.1
Cedergren, R.2
-
17
-
-
0023293718
-
Genetic recombination
-
February
-
F. W. Stahl, "Genetic recombination", Scientific American, 90-101, February 1987.
-
(1987)
Scientific American
, pp. 90-101
-
-
Stahl, F.W.1
-
18
-
-
0001140522
-
Phylogenetic reconstruction
-
Molecular Systemtics, D. Hillis and C. Moritz (eds) , Sunderland, MA
-
D. Swofford and G. Olson, Phylogenetic reconstruction, in Molecular Systemtics, D. Hillis and C. Moritz (eds), Sinauer Associates, Sunderland, MA, 1990.
-
(1990)
Sinauer Associates
-
-
Swofford, D.1
Olson, G.2
-
19
-
-
0004246255
-
-
4th edition, Benjamin-Cummings, Menlo Park, California
-
J. D. Watson, N. H. Hopkins, J. W. Roberts, J. A. Steitz, A. M. Weiner, "Molecular Biology of the gene, 4th edition, Benjamin-Cummings, Menlo Park, California, 1987.
-
(1987)
Molecular Biology of the Gene
-
-
Watson, J.D.1
Hopkins, N.H.2
Roberts, J.W.3
Steitz, J.A.4
Weiner, A.M.5
-
20
-
-
0028679709
-
On the complexity of multiple sequence alignment
-
L. Wang and T. Jiang, On the complexity of multiple sequence alignment, Journal of Computational Biology, 1(1994), 337-348.
-
(1994)
Journal of Computational Biology
, vol.1
, pp. 337-348
-
-
Wang, L.1
Jiang, T.2
-
21
-
-
0000880429
-
Approximation algorithms for tree alignment with a given phylogeny
-
L. Wang, T. Jiang and E. L. Lawler, Approximation algorithms for tree alignment with a given phylogeny, Algorithmica, 16(1996), 302-315.
-
(1996)
Algorithmica
, vol.16
, pp. 302-315
-
-
Wang, L.1
Jiang, T.2
Lawler, E.L.3
-
22
-
-
0000503180
-
Improved approximation algorithms for tree alignment
-
L. Wang and D. Gusfield, Improved approximation algorithms for tree alignment, Journal of Algorithms, vol. 25, pp. 255-173, 1997.
-
(1997)
Journal of Algorithms
, vol.25
, pp. 255-173
-
-
Wang, L.1
Gusfield, D.2
-
23
-
-
0030718157
-
A more efficient approximation scheme for tree alignment
-
L. Wang, T. Jiang, and Dan Gusfield, A more efficient approximation scheme for tree alignment, Proceedings of the First Annual International Conference on Computational Molecular Biology, pp. 310-319, 1997.
-
(1997)
Proceedings of the First Annual International Conference on Computational Molecular Biology
, pp. 310-319
-
-
Wang, L.1
Jiang, T.2
Gusfield, D.3
|