References

Close X

Filter by:

Enter a value to search for title and contributor(s).

Keyword(s)

Enter a comma separated list of keywords.

Type

Year

Sort

Sort by

Order

DasGupta, B., Jiang, T., Kannan, S., Li, M., & Sweedyk, Z. (1997). On the complexity and approximation of syntenic distance

Kececioglu, J., Li, M., & Tromp, J. (1997). Reconstucting a DNA sequence from erroneous copies Theoretical Computer Science, 185:1, 3-13.

Jiang, T., & Li, M. (1997). Shortest common superstring In Chapter 8 in Pattern matching algorithms, pp. 237-266. Oxford University Press.

Kececioglu, J., Li, M., & Tromp, J. (1997). Reconstucting a DNA sequence from erroneous copies Reconstucting a DNA Sequence from Erroneous Copies.

DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., & Zhang, L. (1997). On distances between phylogenetic trees

Li, M., Tromp, J., & Zhang, L. (1996). On the nearest neighbour interchange distance between evolutionary trees Journal of Theoretical Biology, 182, 463-467.

Li, M., Tromp, J., & Zhang, L. (1996). On the nearest neighbour interchange distance measure

Jiang, T., & Li, M. (1996). DNA sequencing and string learning Math. Syst. Theory, 29, 387-405.

Li, M., Tromp, J., & Zhang, L. (1996). On the nearest neighbour interchange distance between evolutionary trees On the Nearest Neighbour Interchange Distance Between Evolutionary Trees.

Jiang, T., & Li, M. (1996). DNA sequencing and string learning DNA Sequencing and String Learning.