Thomas Mailund

	2009
29		Søren Besenbacher, Christian N. S. Pedersen, Thomas Mailund: A fast algorithm for genome-wide haplotype pattern mining. BMC Bioinformatics 10(S-1): (2009)
	2008
28		Martin Simonsen, Thomas Mailund, Christian N. S. Pedersen: Rapid Neighbour-Joining. WABI 2008: 113-122
27		Saskia de Groot, Thomas Mailund, Gerton Lunter, Jotun Hein: Investigating selection on viruses: a statistical alignment approach. BMC Bioinformatics 9: (2008)
26		Jesper Nielsen, Thomas Mailund: SNPFile - A software library and file format for large scale association mapping and population genetics studies. BMC Bioinformatics 9: (2008)
25		Zhihong Ding, Thomas Mailund, Yun S. Song: Efficient whole-genome association mapping using local phylogenies for unphased genotype data. Bioinformatics 24(19): 2215-2221 (2008)
24		Martin Stig Stissing, Thomas Mailund, Christian N. S. Pedersen, Gerth Stølting Brodal, Rolf Fagerberg: Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees. J. Bioinformatics and Computational Biology 6(1): 37-50 (2008)
	2007
23		Martin Stig Stissing, Christian N. S. Pedersen, Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg: Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree. APBC 2007: 101-110
22		Martin Stig Stissing, Thomas Mailund, Christian N. S. Pedersen, Gerth Stølting Brodal, Rolf Fagerberg: Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees. APBC 2007: 91-100
21		Stephen McCauley, Saskia de Groot, Thomas Mailund, Jotun Hein: Annotation of selection strengths in viral genomes. Bioinformatics 23(22): 2978-2986 (2007)
20		Saskia de Groot, Thomas Mailund, Jotun Hein: Comparative annotation of viral genomes with non-conserved gene structure. Bioinformatics 23(9): 1080-1089 (2007)
19		Thomas Mailund, Christian N. S. Pedersen, Jonas Bardino, Brian Vinter, Henrik Hoey Karlsen: Experiences with GeneRecon on MiG. Future Generation Comp. Syst. 23(4): 580-586 (2007)
	2006
18		Chris Christiansen, Thomas Mailund, Christian N. S. Pedersen, Martin Randers, Martin Stig Stissing: Fast calculation of the quartet distance between trees of arbitrary degrees. Algorithms for Molecular Biology 1: (2006)
17		Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Derek Phillips: Recrafting the neighbor-joining method. BMC Bioinformatics 7: 29 (2006)
16		Thomas Mailund, Søren Besenbacher, Mikkel H. Schierup: Whole genome association mapping by incompatibilities and local perfect phylogenies. BMC Bioinformatics 7: 454 (2006)
15		Thomas Mailund, Mikkel H. Schierup, Christian N. S. Pedersen, Jesper N. Madsen, Jotun Hein, Leif Schauser: GeneRecon - a coalescent based tool for fine-scale association mapping. Bioinformatics 22(18): 2317-2318 (2006)
	2005
14		Thomas Mailund, Christian N. S. Pedersen, Jonas Bardino, Brian Vinter, Henrik Hoey Karlsen: Initial Experiences with GeneRecon on MiG. GCA 2005: 141-146
13		Chris Christiansen, Thomas Mailund, Christian N. S. Pedersen, Martin Randers: Computing the Quartet Distance Between Trees of Arbitrary Degree. WABI 2005: 77-88
12		Thomas Mailund, Mikkel H. Schierup, Christian N. S. Pedersen, Peter J. M. Mechlenborg, Jesper N. Madsen, Leif Schauser: CoaSim: A flexible environment for simulating genetic data under coalescent models. BMC Bioinformatics 6: 252 (2005)
11		Søren Besenbacher, Thomas Mailund, Lasse Westh-Nielsen, Christian N. S. Pedersen: RBT - a tool for building refined Buneman trees. Bioinformatics 21(8): 1711-1712 (2005)
	2004
10		Thomas Mailund, Michael Westergaard: Obtaining Memory-Efficient Reachability Graph Representations Using the Sweep-Line Method. TACAS 2004: 177-191
9		Thomas Mailund, Christian N. S. Pedersen: QDist-quartet distance between evolutionary trees. Bioinformatics 20(10): 1636-1637 (2004)
8		Thomas Mailund, Christian N. S. Pedersen: QuickJoin - fast neighbour-joining tree reconstruction. Bioinformatics 20(17): 3261-3262 (2004)
7		Jonathan Billington, Guy Edward Gallasch, Lars Michael Kristensen, Thomas Mailund: Exploiting equivalence reduction and the sweep-line method for detecting terminal states. IEEE Transactions on Systems, Man, and Cybernetics, Part A 34(1): 23-37 (2004)
	2003
6		Lars Michael Kristensen, Thomas Mailund: Efficient Path Finding with the Sweep-Line Method Using External Storage. ICFEM 2003: 319-337
	2002
5		Lars Michael Kristensen, Thomas Mailund: A Generalised Sweep-Line Method for Safety Properties. FME 2002: 549-567
4		Lars Michael Kristensen, Thomas Mailund: A Compositional Sweep-Line State Space Exploration Method. FORTE 2002: 327-343
3		Thomas Mailund: Analysing Infinite-State Systems by Combining Equivalence Reduction and the Sweep-Line Method. ICATPN 2002: 314-334
	2001
2		Søren Christensen, Lars Michael Kristensen, Thomas Mailund: Condensed State Spaces for Timed Petri Nets. ICATPN 2001: 101-120
1		Søren Christensen, Lars Michael Kristensen, Thomas Mailund: A Sweep-Line Method for State Space Exploration. TACAS 2001: 450-464

Coauthor Index

1	Jonas Bardino	[14] [19]
2	Søren Besenbacher	[11] [16] [29]
3	Jonathan Billington	[7]
4	Gerth Stølting Brodal	[17] [22] [23] [24]
5	Søren Christensen	[1] [2]
6	Chris Christiansen	[13] [18]
7	Zhihong Ding	[25]
8	Rolf Fagerberg	[17] [22] [23] [24]
9	Guy Edward Gallasch	[7]
10	Saskia de Groot	[20] [21] [27]
11	Jotun Hein	[15] [20] [21] [27]
12	Henrik Hoey Karlsen	[14] [19]
13	Lars Michael Kristensen	[1] [2] [4] [5] [6] [7]
14	Gerton Lunter	[27]
15	Jesper N. Madsen	[12] [15]
16	Stephen McCauley	[21]
17	Peter J. M. Mechlenborg	[12]
18	Jesper Nielsen	[26]
19	Christian N. S. Pedersen	[8] [9] [11] [12] [13] [14] [15] [17] [18] [19] [22] [23] [24] [28] [29]
20	Derek Phillips	[17]
21	Martin Randers	[13] [18]
22	Leif Schauser	[12] [15]
23	Mikkel H. Schierup	[12] [15] [16]
24	Martin Simonsen	[28]
25	Yun S. Song	[25]
26	Martin Stig Stissing	[18] [22] [23] [24]
27	Brian Vinter	[14] [19]
28	Michael Westergaard	[10]
29	Lasse Westh-Nielsen	[11]