Tandy Warnow
Tandy Warnow
Founder Professor of Computer Science, UIUC
Dirección de correo verificada de illinois.edu - Página principal
TítuloCitado porAño
4.2 Cancer genomics
M El-Kebir, N Beerenwinkel, C Boucher, AK Emde, B Kehr, GW Klau, ...
Next Generation Sequencing–Algorithms, and Software For Biomedical …, 0
7. The culture of the speakers of Proto-Indo-European
E Sturtevant, M Swadesh, O Szemerényi, J Tischler, R Wallace, T Warnow, ...
Linguistics 21 (121), 137, 1993
1993
A brief tutorial on SEPP
S Mirarab, N Nguyen, T Warnow
2012
A character based method for reconstructing evolutionary history for natural languages
T Warnow, D Ringe, A Taylor
Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms …, 1996
71996
A comparative study of SVDquartets and other coalescent-based species tree estimation methods
J Chou, A Gupta, S Yaduvanshi, R Davidson, M Nute, S Mirarab, ...
BMC genomics 16 (10), S2, 2015
702015
A comparison of phylogenetic reconstruction methods on an ie dataset
L Nakleh, T Warnow, D Ringe, SN Evans
Transactions of the Philological Society 103 (2), 171-192, 2005
92005
A comparison of phylogenetic reconstruction methods on an Indo‐European dataset
L Nakhleh, T Warnow, D Ringe, SN Evans
Transactions of the Philological Society 103 (2), 171-192, 2005
1022005
A fast algorithm for the computation and enumeration of perfect phylogenies
S Kannan, T Warnow
SIAM Journal on Computing 26 (6), 1749-1763, 1997
1201997
A few logs su ce to build (almost) all trees (II)
MA Steel, TJ Warnow
1997
A few logs suffice to build (almost) all trees - I
PL Erdös, MA Steel, LA Székely, TJ Warnow
Random Structures and Algorithms 14 (2), 153-184, 1999
171*1999
A few logs suffice to build (almost) all trees - Part I
PL Erdos, M Steel, L Szekely, T Warnow
Random Structures and Algorithms 14 (2), 153-184, 1999
183*1999
A few logs suffice to build (almost) all trees: part II
PL Erdös, MA Steel, LA Székely, TJ Warnow
Theoretical Computer Science 221 (1-2), 77-118, 1999
1711999
A few logs suffice to build (almost) all trees: part II
PL Erdös, MA Steel, LA Székely, TJ Warnow
Theoretical Computer Science 221 (1-2), 77-118, 1999
1711999
A few logs suffice to build (almost) all trees: part II
PL Erdös, MA Steel, LA Székely, TJ Warnow
Theoretical Computer Science 221 (1-2), 77-118, 1999
1711999
A few logs suffice to build (almost) all trees: part II
PL Erdös, MA Steel, LA Székely, TJ Warnow
Theoretical Computer Science 221 (1-2), 77-118, 1999
1711999
A few logs suffice to build (almost) all trees: part II
PL Erdös, MA Steel, LA Székely, TJ Warnow
Theoretical Computer Science 221 (1-2), 77-118, 1999
1711999
A few logs suffice to build (almost) all trees: part II
PL Erdös, MA Steel, LA Székely, TJ Warnow
Theoretical Computer Science 221 (1-2), 77-118, 1999
1711999
A few logs suffice to build (almost) all trees: part II
PL Erdös, MA Steel, LA Székely, TJ Warnow
Theoretical Computer Science 221 (1-2), 77-118, 1999
1711999
A few logs suffice to build (almost) all trees: part II
PL Erdös, MA Steel, LA Székely, TJ Warnow
Theoretical Computer Science 221 (1-2), 77-118, 1999
1711999
A few logs suffice to build (almost) all trees: part II
PL Erdös, MA Steel, LA Székely, TJ Warnow
Theoretical Computer Science 221 (1-2), 77-118, 1999
1711999
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20