| A low-polynomial algorithm for assembling clusters of orthologous groups from intergenomic symmetric best matches DM Kristensen, L Kannan, MK Coleman, YI Wolf, A Sorokin, EV Koonin, ... Bioinformatics 26 (12), 1481-1487, 2010 | 228 | 2010 |
| Consensus on molecular subtypes of high-grade serous ovarian carcinoma GM Chen, L Kannan, L Geistlinger, V Kofia, Z Safikhani, DMA Gendoo, ... Clinical Cancer Research 24 (20), 5037-5047, 2018 | 107 | 2018 |
| Maximum parsimony on phylogenetic networks L Kannan, WC Wheeler Algorithms for molecular biology 7, 1-10, 2012 | 85 | 2012 |
| Public data and open source tools for multi-assay genomic investigation of disease L Kannan, M Ramos, A Re, N El-Hachem, Z Safikhani, DMA Gendoo, ... Briefings in bioinformatics 17 (4), 603-615, 2016 | 61 | 2016 |
| Models of gene gain and gene loss for probabilistic reconstruction of gene content in the last universal common ancestor of life L Kannan, H Li, B Rubinstein, A Mushegian Biology Direct 8, 1-12, 2013 | 22 | 2013 |
| Consensus on molecular subtypes of ovarian cancer GM Chen, L Kannan, L Geistlinger, V Kofia, Z Safikhani, DMA Gendoo, ... bioRxiv, 162685, 2017 | 8 | 2017 |
| Exactly computing the parsimony scores on phylogenetic networks using dynamic programming L Kannan, WC Wheeler Journal of Computational Biology 21 (4), 303-319, 2014 | 8 | 2014 |
| Balanced and 1-balanced graph constructions AM Hobbs, L Kannan, HJ Lai, H Lai, G Weng Discrete applied mathematics 158 (14), 1511-1523, 2010 | 6 | 2010 |
| Transforming a graph into a 1-balanced graph L Kannan, A Hobbs, HJ Lai, H Lai Discrete applied mathematics 157 (2), 300-308, 2009 | 6 | 2009 |
| A polynomial-time algorithm computing lower and upper bounds of the rooted subtree prune and regraft distance L Kannan, H Li, A Mushegian Journal of Computational Biology 18 (5), 743-757, 2011 | 1 | 2011 |
| Densities in graphs and matroids L Kannan Texas A&M University, 2007 | 1 | 2007 |
| Exactly Computing the Parsimony Scores on Phylogenetic Networks Using Dynamic Programming (vol 21, pg 303, 2014) L Kannan, WC Wheeler JOURNAL OF COMPUTATIONAL BIOLOGY 21 (6), 476-476, 2014 | | 2014 |
| My Research L Kannan | | 2006 |
| OBTAINING UNIFORMLY DENSE GRAPHS L KANNAN, HJ LAI, H LAI | | 2006 |
| Constructing Graphs from sequences L Kannan | | 2002 |
| A lower bound heuristic for the subtree prune and regraft distance between rooted trees L Kannan, H Li, A Mushegian | | |
Ward WheelerProfessor Richard Gilder Graduate School, American Museum of Natural HistoryVerified email at amnh.org
