Tandy J. Warnow

Orcid: 0000-0001-7717-3514

Affiliations:
  • University of Illinois at Urbana-Champaign, Department of Computer Science, IL, USA
  • University of Texas at Austin, Department of Computer Science, TX, USA


According to our database1, Tandy J. Warnow authored at least 171 papers between 1990 and 2024.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 2015, "For contributions to mathematical theory, algorithms, and software for large-scale molecular phylogenetics and historical linguistics.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
CM++ - A Meta-method for Well-Connected Community Detection.
J. Open Source Softw., February, 2024

FastEnsemble: A new scalable ensemble clustering method.
CoRR, 2024

Synthetic Networks That Preserve Edge Connectivity.
CoRR, 2024

Improved Community Detection using Stochastic Block Models.
CoRR, 2024

Statistically Consistent Estimation of Rooted and Unrooted Level-1 Phylogenetic Networks from SNP Data.
Proceedings of the Comparative Genomics - 21st International Conference, 2024

2023
EMMA: a new method for computing multiple sequence alignments given a constraint subset alignment.
Algorithms Mol. Biol., December, 2023

Weighted ASTRID: fast and accurate species trees from weighted internode distances.
Algorithms Mol. Biol., December, 2023

QR-STAR: A Polynomial-Time Statistically Consistent Method for Rooting Species Trees Under the Coalescent.
J. Comput. Biol., November, 2023

UPP2: fast and accurate alignment of datasets with fragmentary sequences.
Bioinform., January, 2023

Large-Scale Multiple Sequence Alignment and the Maximum Weight Trace Alignment Merging Problem.
IEEE ACM Trans. Comput. Biol. Bioinform., 2023

SCAMPP: Scaling Alignment-Based Phylogenetic Placement to Large Trees.
IEEE ACM Trans. Comput. Biol. Bioinform., 2023

Axioms for Distanceless Graph Partitioning.
CoRR, 2023

Well-Connected Communities in Real-World Networks.
CoRR, 2023

Phylogenomic branch length estimation using quartets.
Bioinform., 2023

BATCH-SCAMPP: Scaling Phylogenetic Placement Methods to Place Many Sequences (Abstract).
Proceedings of the 23rd International Workshop on Algorithms in Bioinformatics, 2023

EMMA: Adding Sequences into a Constraint Alignment with High Accuracy and Scalability (Abstract).
Proceedings of the 23rd International Workshop on Algorithms in Bioinformatics, 2023

Statistically Consistent Rooting of Species Trees Under the Multispecies Coalescent Model.
Proceedings of the Research in Computational Molecular Biology, 2023

Identifying Well-Connected Communities in Real-World and Synthetic Networks.
Proceedings of the Complex Networks & Their Applications XII, 2023

2022
Center-periphery structure in research communities.
Quant. Sci. Stud., 2022

AOC: Assembling overlapping communities.
Quant. Sci. Stud., 2022

Re-evaluating Deep Neural Networks for Phylogeny Estimation: The Issue of Taxon Sampling.
J. Comput. Biol., 2022

WITCH: Improved Multiple Sequence Alignment Through Weighted Consensus Hidden Markov Model Alignment.
J. Comput. Biol., 2022

Scalable Species Tree Inference with External Constraints.
J. Comput. Biol., 2022

MAGUS+eHMMs: improved multiple sequence alignment accuracy for fragmentary sequences.
Bioinform., 2022

Fast and Accurate Species Trees from Weighted Internode Distances.
Proceedings of the 22nd International Workshop on Algorithms in Bioinformatics, 2022

2021
Polynomial-Time Statistical Estimation of Species Trees Under Gene Duplication and Loss.
J. Comput. Biol., May, 2021

Profile Hidden Markov Models Are Not Identifiable.
IEEE ACM Trans. Comput. Biol. Bioinform., 2021

Using Constrained-INC for Large-Scale Gene Tree and Species Tree Estimation.
IEEE ACM Trans. Comput. Biol. Bioinform., 2021

Finding scientific communities in citation graphs: Articles and authors.
Quant. Sci. Stud., 2021

Center-Periphery Structure in Communities: Extracellular Vesicles.
CoRR, 2021

MAGUS: Multiple sequence Alignment using Graph clUStering.
Bioinform., 2021

TIPP2: metagenomic taxonomic profiling using phylogenetic markers.
Bioinform., 2021

Accurate large-scale phylogeny-aware alignment using BAli-Phy.
Bioinform., 2021

FASTRAL: improving scalability of phylogenomic analysis.
Bioinform., 2021

Using Robinson-Foulds supertrees in divide-and-conquer phylogeny estimation.
Algorithms Mol. Biol., 2021

Disjoint Tree Mergers for Large-Scale Maximum Likelihood Tree Estimation.
Algorithms, 2021

ppIacerDC: a new scalable phylogenetic placement method.
Proceedings of the BCB '21: 12th ACM International Conference on Bioinformatics, 2021

The Maximum Weight Trace Alignment Merging Problem.
Proceedings of the Algorithms for Computational Biology - 8th International Conference, 2021

Comparing Methods for Species Tree Estimation with Gene Duplication and Loss.
Proceedings of the Algorithms for Computational Biology - 8th International Conference, 2021

Scalable and Accurate Phylogenetic Placement Using pplacer-XR.
Proceedings of the Algorithms for Computational Biology - 8th International Conference, 2021

2020
Viewing computer science through citation analysis: Salton and Bergmark Redux.
Scientometrics, 2020

Frequently cocited publications: Features and kinetics.
Quant. Sci. Stud., 2020

Co-citations in context: Disciplinary heterogeneity is relevant.
Quant. Sci. Stud., 2020

Finding Scientific Communities In Citation Graphs: Convergent Clustering.
CoRR, 2020

Frequently Co-cited Publications: Features and Kinetics.
CoRR, 2020

FastMulRFS: fast and accurate species tree estimation under generic gene duplication and loss models.
Bioinform., 2020

Non-parametric correction of estimated gene trees using TRACTION.
Algorithms Mol. Biol., 2020

Advancing Divide-And-Conquer Phylogeny Estimation Using Robinson-Foulds Supertrees.
Proceedings of the 20th International Workshop on Algorithms in Bioinformatics, 2020

2019
Misunderstood parameter of NCBI BLAST impacts the correctness of bioinformatics workflows.
Bioinform., 2019

TreeMerge: a new method for improving the scalability of species tree estimation methods.
Bioinform., 2019

Constrained incremental tree building: new absolute fast converging phylogeny estimation methods with improved scalability and accuracy.
Algorithms Mol. Biol., 2019

Statistically consistent divide-and-conquer pipelines for phylogeny estimation using NJMerge.
Algorithms Mol. Biol., 2019

TRACTION: Fast Non-Parametric Improvement of Estimated Gene Trees.
Proceedings of the 19th International Workshop on Algorithms in Bioinformatics, 2019

New Divide-and-Conquer Techniques for Large-Scale Phylogenetic Estimation.
Proceedings of the Algorithms for Computational Biology - 6th International Conference, 2019

Using INC Within Divide-and-Conquer Phylogeny Estimation.
Proceedings of the Algorithms for Computational Biology - 6th International Conference, 2019

2018
The development and application of bioinformatics core competencies to improve bioinformatics training and education.
PLoS Comput. Biol., 2018

Long-branch attraction in species tree estimation: inconsistency of partitioned likelihood and topology-based summary methods.
CoRR, 2018

PASTA for proteins.
Bioinform., 2018

OCTAL: Optimal Completion of gene trees in polynomial time.
Algorithms Mol. Biol., 2018

Gene tree parsimony for incomplete gene trees: addressing true biological loss.
Algorithms Mol. Biol., 2018

New Absolute Fast Converging Phylogeny Estimation Methods with Improved Scalability and Accuracy.
Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

NJMerge: A Generic Technique for Scaling Phylogeny Estimation Methods and Its Application to Species Trees.
Proceedings of the Comparative Genomics - 16th International Conference, 2018

Are Profile Hidden Markov Models Identifiable?
Proceedings of the 2018 ACM International Conference on Bioinformatics, 2018

2017
FastRFS: fast and accurate Robinson-Foulds Supertrees using constrained exact optimization.
Bioinform., 2017

Optimal Completion of Incomplete Gene Trees in Polynomial Time Using OCTAL.
Proceedings of the 17th International Workshop on Algorithms in Bioinformatics, 2017

Gene Tree Parsimony for Incomplete Gene Trees.
Proceedings of the 17th International Workshop on Algorithms in Bioinformatics, 2017

Enhancing Searches for Optimal Trees Using SIESTA.
Proceedings of the Comparative Genomics - 15th International Workshop, 2017

Computational Challenges in Constructing the Tree of Life.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

Genome-scale Estimation of the Tree of Life.
Proceedings of the 8th ACM International Conference on Bioinformatics, 2017

2016
Applying, Evaluating and Refining Bioinformatics Core Competencies (An Update from the Curriculum Task Force of ISCB's Education Committee).
PLoS Comput. Biol., 2016

Next Generation Sequencing (Dagstuhl Seminar 16351).
Dagstuhl Reports, 2016

An analytical upper bound on the number of loci required for all splits of a species tree to appear in a set of gene trees.
BMC Bioinform., 2016

2015
PASTA: Ultra-Large Multiple Sequence Alignment for Nucleotide and Amino-Acid Sequences.
J. Comput. Biol., 2015

Ultra-large alignments using Phylogeny-aware Profiles.
CoRR, 2015

ASTRAL-II: coalescent-based species tree estimation with many hundreds of taxa and thousands of genes.
Bioinform., 2015

Ultra-Large Alignments Using Ensembles of Hidden Markov Models.
Proceedings of the Research in Computational Molecular Biology, 2015

2014
TIPP: taxonomic identification and phylogenetic profiling.
Bioinform., 2014

ASTRAL: genome-scale coalescent-based species tree estimation.
Bioinform., 2014

PASTA: Ultra-Large Multiple Sequence Alignment.
Proceedings of the Research in Computational Molecular Biology, 2014

2013
Naive binning improves phylogenomic analyses.
Bioinform., 2013

Session introduction.
Proceedings of the Biocomputing 2013: Proceedings of the Pacific Symposium, 2013

Inferring Optimal Species Trees Under Gene Duplication and Loss.
Proceedings of the Biocomputing 2013: Proceedings of the Pacific Symposium, 2013

Large-Scale Multiple Sequence Alignment and Phylogeny Estimation.
Proceedings of the Models and Algorithms for Genome Evolution, 2013

2012
Estimating Optimal Species Trees from Incomplete Gene Trees Under Deep Coalescence.
J. Comput. Biol., 2012

DACTAL: divide-and-conquer trees (almost) without alignments.
Bioinform., 2012

MRL and SuperFine+MRL: new supertree methods.
Algorithms Mol. Biol., 2012

Parallelizing SuperFine.
Proceedings of the ACM Symposium on Applied Computing, 2012

SEPP: SATe -Enabled Phylogenetic Placement.
Proceedings of the Biocomputing 2012: Proceedings of the Pacific Symposium, 2012

2011
The Impact of Multiple Protein Sequence Alignment on Phylogenetic Estimation.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011

Algorithms for MDC-Based Multi-Locus Phylogeny Inference: Beyond Rooted Binary Gene Trees on Single Alleles.
J. Comput. Biol., 2011

Fast and accurate methods for phylogenomic analyses.
BMC Bioinform., 2011

FASTSP: linear time calculation of alignment accuracy.
Bioinform., 2011

An experimental study of Quartets MaxCut and other supertree methods.
Algorithms Mol. Biol., 2011

Algorithms for MDC-Based Multi-locus Phylogeny Inference.
Proceedings of the Research in Computational Molecular Biology, 2011

2010
A simulation study comparing supertree and combined analysis methods using SMIDGen.
Algorithms Mol. Biol., 2010

2009
Barking Up The Wrong Treelength: The Impact of Gap Penalty on Alignment and Tree Accuracy.
IEEE ACM Trans. Comput. Biol. Bioinform., 2009

2008
Tutorial on Computational Linguistic Phylogeny.
Lang. Linguistics Compass, 2008

Short Quartet Puzzling: A New Quartet-Based Phylogeny Reconstruction Algorithm.
J. Comput. Biol., 2008

The Effect of the Guide Tree on Multiple Sequence Alignments and Subsequent Phylogenetic Analysis.
Proceedings of the Biocomputing 2008, 2008

Session Introduction.
Proceedings of the Biocomputing 2008, 2008

2007
Distance-based genome rearrangement phylogeny.
Proceedings of the Mathematics of Evolution and Phylogeny., 2007

Reconstructing phylogenies from gene-content and gene-order data.
Proceedings of the Mathematics of Evolution and Phylogeny., 2007

2006
Pattern Identification in Biogeography.
IEEE ACM Trans. Comput. Biol. Bioinform., 2006

Reconstructing Chromosomal Evolution.
SIAM J. Comput., 2006

2005
Reconstructing Reticulate Evolution in SpeciesTheory and Practice.
J. Comput. Biol., 2005

Pattern Identification in Biogeography.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

2004
Preface.
Theor. Comput. Sci., 2004

Phylogenetic Networks: Modeling, Reconstructibility, and Accuracy.
IEEE ACM Trans. Comput. Biol. Bioinform., 2004

Unidentifiable Divergence Times in Rates-across-Sites Models.
IEEE ACM Trans. Comput. Biol. Bioinform., 2004

On contract-and-refine transformations between phylogenetic trees.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Reconstructing reticulate evolution in species: theory and practice.
Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004

Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees.
Proceedings of the 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, 2004

2003
Analyzing the Order of Items in Manuscripts of <i>The Canterbury Tales</i>.
Comput. Humanit., 2003

Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining.
J. Algorithms, 2003

Better Hill-Climbing Searches for Parsimony.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

Towards the Development of Computational Tools for Evaluating Phylogenetic Network Reconstruction Methods.
Proceedings of the 8th Pacific Symposium on Biocomputing, 2003

2002
High-Performance Algorithm Engineering for Computational Phylogenetics.
J. Supercomput., 2002

Steps toward accurate reconstructions of phylogenies from gene-order data.
J. Comput. Syst. Sci., 2002

Toward New Software for Computational Phylogenetics.
Computer, 2002

Estimating the Deviation from a Molecular Clock.
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Sequence-Length Requirements for Phylogenetic Methods.
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Fast Phylogenetic Methods for the Analysis of Genome Rearrangement Data: An Empirical Study.
Proceedings of the 7th Pacific Symposium on Biocomputing, 2002

The Accuracy of Fast Phylogenetic Methods for Large Datasets.
Proceedings of the 7th Pacific Symposium on Biocomputing, 2002

Statistically based postprocessing of phylogenetic analysis by clustering.
Proceedings of the Tenth International Conference on Intelligent Systems for Molecular Biology, 2002

Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001
The Performance of Phylogenetic Methods on Trees of Bounded Diameter.
Proceedings of the Algorithms in Bioinformatics, First International Workshop, 2001

Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time.
Proceedings of the Algorithms in Bioinformatics, First International Workshop, 2001

Estimating true evolutionary distances between genomes.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Absolute convergence: true trees from short sequences.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

A New Implmentation and Detailed Study of Breakpoint Analysis.
Proceedings of the 6th Pacific Symposium on Biocomputing, 2001

Designing fast converging phylogenetic methods.
Proceedings of the Ninth International Conference on Intelligent Systems for Molecular Biology, 2001

New approaches for reconstructing phylogenies from gene order data.
Proceedings of the Ninth International Conference on Intelligent Systems for Molecular Biology, 2001

2000
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs.
Theor. Comput. Sci., 2000

A New Fast Heuristic for Computing the Breakpoint Phylogeny and Experimental Phylogenetic Analyses of Real and Synthetic Data.
Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, 2000

Reconstructing Optimal Phylogenetic Trees: A Challenge in Experimental Algorithmics.
Proceedings of the Experimental Algorithmics, 2000

1999
A Few Logs Suffice to Build (almost) All Trees: Part II.
Theor. Comput. Sci., 1999

Constructing Evolutionary Trees in the Presence of Polymorphic Characters.
SIAM J. Comput., 1999

A few logs suffice to build (almost) all trees (I).
Random Struct. Algorithms, 1999

Hybrid Tree Reconstruction Methods.
ACM J. Exp. Algorithmics, 1999

Disk-Covering, a Fast-Converging Method for Phylogenetic Tree Reconstruction.
J. Comput. Biol., 1999

Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology.
Algorithmica, 1999

Estimating Large Distances in Phylogenetic Reconstruction.
Proceedings of the Algorithm Engineering, 1999

Obtaining highly accurate topology estimates of evolutionary trees from very short sequences.
Proceedings of the Third Annual International Conference on Research in Computational Molecular Biology, 1999

Solving Large Scale Phylogenetic Problems using DCM2.
Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology, 1999

1998
Computing the Local Consensus of Trees.
SIAM J. Comput., 1998

Better Methods for Solving Parsimony and Compatibility.
J. Comput. Biol., 1998

1997
A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies.
SIAM J. Comput., 1997

Local Quartet Splits of a Binary Tree Infer All Quartet Splits Via One Dyadic Inference Rule.
Comput. Artif. Intell., 1997

Constructing Big Trees from Short Sequences.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Parsimony is Hard to Beat.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996
Determining the Evolutionary Tree Using Experiments.
J. Algorithms, 1996

The Asymmetric Median Tree - A New Model for Building Consensus Trees.
Discret. Appl. Math., 1996

Minimizing Phylogenetic Number To Find Good Evolutionary Trees.
Discret. Appl. Math., 1996

Reconstructing the Evolutionary History of Natural Languages.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Inferring evolutionary trees from polymorphic characters, and an analysis of the Indo-European family of languages.
Proceedings of the Mathematical Hierarchies and Biology, 1996

1995
Tree Reconstruction from Partial Orders.
SIAM J. Comput., 1995

Hen's Teeth and Whale's Feet: Generalized Characters and Their Compatibility.
J. Comput. Biol., 1995

A Robust Model for Finding Optimal Evolutionary Trees.
Algorithmica, 1995

Computing the Local Consensus of Trees.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies when the Number of Character States is Fixed.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Of Chicken Teeth and Mouse Eyes, or Generalized Character Compatibility.
Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995

1994
Triangulating Vertex-Colored Graphs.
SIAM J. Discret. Math., 1994

Inferring Evolutionary History from DNA Sequences.
SIAM J. Comput., 1994

Tree Compatibility and Inferring Evolutionary History.
J. Algorithms, 1994

1993
Kaikoura Tree Theorems: Computing the Maximum Agreement Subtree.
Inf. Process. Lett., 1993

Tree Compatibility and Inferring Evoluationary History.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

1992
Triangulating 3-Colored Graphs.
SIAM J. Discret. Math., 1992

Two Strikes Against Perfect Phylogeny.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991
Triangulating Three-Colored Graphs.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990
Determining the Evolutionary Tree.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

Inferring Evolutionary History from DNA Sequences (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990


  Loading...