Thomas Mailund

According to our database1, Thomas Mailund
  • authored at least 43 papers between 2001 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
admixturegraph: an R package for admixture graph manipulation and fitting.
Bioinformatics, 2017

Fast admixture analysis and population tree estimation for SNP and NGS data.
Bioinformatics, 2017

2016
A genomic history of Aboriginal Australia.
Nature, 2016

2015
Ancestral population genomics using coalescence hidden Markov models and heuristic optimisation algorithms.
Computational Biology and Chemistry, 2015

2014
Identifying disease associated genes by network propagation.
BMC Systems Biology, 2014

tqDist: a library for computing the quartet and triplet distances between binary or general trees.
Bioinformatics, 2014

2013
zipHMMlib: a highly optimised HMM library exploiting repetitions in the input to speed up the forward algorithm.
BMC Bioinformatics, 2013

A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees.
BMC Bioinformatics, 2013

Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012
The sweep-line state space exploration method.
Theor. Comput. Sci., 2012

Using Colored Petri Nets to Construct Coalescent Hidden Markov Models: Automatic Translation from Demographic Specifications to Efficient Inference Methods.
Proceedings of the Application and Theory of Petri Nets - 33rd International Conference, 2012

2011
A sub-cubic time algorithm for computing the quartet distance between two general trees.
Algorithms for Molecular Biology, 2011

2010
Building Very Large Neighbour-joining Trees.
Proceedings of the BIOINFORMATICS 2010, 2010

2009
A fast algorithm for genome-wide haplotype pattern mining.
BMC Bioinformatics, 2009

A Quadratic Time Algorithm for Computing the Quartet Distance between Two General Trees.
Proceedings of the International Joint Conferences on Bioinformatics, 2009

2008
Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees.
J. Bioinformatics and Computational Biology, 2008

SNPFile - A software library and file format for large scale association mapping and population genetics studies.
BMC Bioinformatics, 2008

Investigating selection on viruses: a statistical alignment approach.
BMC Bioinformatics, 2008

Efficient whole-genome association mapping using local phylogenies for unphased genotype data.
Bioinformatics, 2008

Rapid Neighbour-Joining.
Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

2007
Experiences with GeneRecon on MiG.
Future Generation Comp. Syst., 2007

Annotation of selection strengths in viral genomes.
Bioinformatics, 2007

Comparative annotation of viral genomes with non-conserved gene structure.
Bioinformatics, 2007

Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree.
Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees.
Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

2006
Whole genome association mapping by incompatibilities and local perfect phylogenies.
BMC Bioinformatics, 2006

Recrafting the neighbor-joining method.
BMC Bioinformatics, 2006

GeneRecon - a coalescent based tool for fine-scale association mapping.
Bioinformatics, 2006

Fast calculation of the quartet distance between trees of arbitrary degrees.
Algorithms for Molecular Biology, 2006

2005
CoaSim: A flexible environment for simulating genetic data under coalescent models.
BMC Bioinformatics, 2005

RBT - a tool for building refined Buneman trees.
Bioinformatics, 2005

Computing the Quartet Distance Between Trees of Arbitrary Degree.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

Initial Experiences with GeneRecon on MiG.
Proceedings of The 2005 International Conference on Grid Computing and Applications, 2005

2004
Exploiting equivalence reduction and the sweep-line method for detecting terminal states.
IEEE Trans. Systems, Man, and Cybernetics, Part A, 2004

QuickJoin - fast neighbour-joining tree reconstruction.
Bioinformatics, 2004

QDist-quartet distance between evolutionary trees.
Bioinformatics, 2004

Obtaining Memory-Efficient Reachability Graph Representations Using the Sweep-Line Method.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

2003
Efficient Path Finding with the Sweep-Line Method Using External Storage.
Proceedings of the Formal Methods and Software Engineering, 2003

2002
A Compositional Sweep-Line State Space Exploration Method.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2002

A Generalised Sweep-Line Method for Safety Properties.
Proceedings of the FME 2002: Formal Methods, 2002

Analysing Infinite-State Systems by Combining Equivalence Reduction and the Sweep-Line Method.
Proceedings of the Applications and Theory of Petri Nets 2002, 2002

2001
A Sweep-Line Method for State Space Exploration.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2001

Condensed State Spaces for Timed Petri Nets.
Proceedings of the Application and Theory of Petri Nets 2001, 2001


  Loading...