Lavanya Kannan, Ph.D.
Affiliations: | 2007 | Texas A & M University, College Station, TX, United States |
Area:
MathematicsGoogle:
"Lavanya Kannan"Parents
Sign in to add mentor| Arthur M. Hobbs | grad student | 2007 | Texas A & M | |
| (Densities in graphs and matroids.) | ||||
| Ward C. Wheeler | post-doc | American Museum of Natural History (Computer Science Tree) | ||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Kannan L, Wheeler WC. (2014) Exactly computing the parsimony scores on phylogenetic networks using dynamic programming. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 21: 303-19 |
| Kannan L, Wheeler WC. (2012) Maximum Parsimony on Phylogenetic networks. Algorithms For Molecular Biology : Amb. 7: 9 |
| Kannan L, Li H, Mushegian A. (2011) A polynomial-time algorithm computing lower and upper bounds of the rooted subtree prune and regraft distance. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 18: 743-57 |
| Hobbs AM, Kannan L, Lai HJ, et al. (2010) Balanced and 1-balanced graph constructions Discrete Applied Mathematics. 158: 1511-1523 |
| Kannan L, Hobbs A, Lai HJ, et al. (2009) Transforming a graph into a 1-balanced graph Discrete Applied Mathematics. 157: 300-308 |