default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Mailund
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j30]Maria Luisa Matey-Hernandez
, Lasse Maretty, Jacob Malte Jensen, Bent Petersen, Jonas Andreas Sibbesen, Siyang Liu, Palle Villesen, Laurits Skov, Kirstine Belling, Christian Theil Have, José M. G. Izarzugaza, Marie Grosjean, Jette Bork-Jensen, Jakob Grove, Thomas D. Als, Shujia Huang, Yuqi Chang, Ruiqi Xu, Weijian Ye, Junhua Rao, Xiaosen Guo, Jihua Sun, Hongzhi Cao, Chen Ye, John van Beusekom, Thomas Espeseth, Esben N. Flindt, Rune M. Friborg, Anders E. Halager, Stephanie Le Hellard, Christina M. Hultman, Francesco Lescai, Shengting Li, Ole Lund, Peter Løngreen, Thomas Mailund, Ole Mors, Christian N. S. Pedersen, Thomas Sicheritz-Pontén, Patrick F. Sullivan, Ali Syed, David Westergaard, Rachita Yadav, Ning Li, Xun Xu, Torben Hansen, Anders Krogh, Lars Bolund, Thorkild I. A. Sørensen, Oluf Pedersen, Ramneek Gupta, Simon Rasmussen, Søren Besenbacher, Anders D. Børglum, Jun Wang, Hans Eiberg, Karsten Kristiansen, Mikkel Heide Schierup, Søren Brunak:
Benchmarking the HLA typing performance of Polysolver and Optitype in 50 Danish parental trios. BMC Bioinform. 19(1): 239:1-239:12 (2018)- 2017
- [b1]Thomas Mailund:
Advanced Object-Oriented Programming in R - Statistical Programming for Data Science, Analysis and Finance. Apress 2017, ISBN 978-1-4842-2918-7, pp. 1-110 - [j29]Kalle Leppälä, Svend V. Nielsen, Thomas Mailund:
admixturegraph: an R package for admixture graph manipulation and fitting. Bioinform. 33(11): 1738-1740 (2017) - [j28]Jade Yu Cheng, Thomas Mailund, Rasmus Nielsen:
Fast admixture analysis and population tree estimation for SNP and NGS data. Bioinform. 33(14): 2148-2155 (2017) - [j27]Lasse Maretty, Jacob Malte Jensen, Bent Petersen, Jonas Andreas Sibbesen, Siyang Liu, Palle Villesen, Laurits Skov, Kirstine Belling, Christian Theil Have, José M. G. Izarzugaza, Marie Grosjean, Jette Bork-Jensen, Jakob Grove, Thomas D. Als, Shujia Huang, Yuqi Chang, Ruiqi Xu, Weijian Ye, Junhua Rao, Xiaosen Guo, Jihua Sun, Hongzhi Cao, Chen Ye, John van Beusekom, Thomas Espeseth, Esben N. Flindt, Rune M. Friborg, Anders E. Halager, Stephanie Le Hellard, Christina M. Hultman, Francesco Lescai, Shengting Li, Ole Lund, Peter Løngreen, Thomas Mailund, Maria Luisa Matey-Hernandez, Ole Mors, Christian N. S. Pedersen, Thomas Sicheritz-Pontén, Patrick F. Sullivan, Ali Syed, David Westergaard, Rachita Yadav, Ning Li, Xun Xu, Torben Hansen, Anders Krogh, Lars Bolund, Thorkild I. A. Sørensen, Oluf Pedersen, Ramneek Gupta, Simon Rasmussen, Søren Besenbacher, Anders D. Børglum, Jun Wang, Hans Eiberg, Karsten Kristiansen, Søren Brunak, Mikkel Heide Schierup:
Sequencing and de novo assembly of 150 genomes from Denmark as a population reference. Nat. 548(7665): 87-91 (2017) - 2016
- [j26]Anna-Sapfo Malaspinas, Michael C. Westaway, Craig Muller, Vitor C. Sousa, Oscar Lao, Isabel Alves, Anders Bergström, Georgios Athanasiadis, Jade Yu Cheng, Jacob E. Crawford, Tim H. Heupink, Enrico Macholdt, Stephan Peischl, Simon Rasmussen, Stephan Schiffels, Sankar Subramanian, Joanne L. Wright, Anders Albrechtsen, Chiara Barbieri, Isabelle Dupanloup, Anders Eriksson, Ashot Margaryan, Ida Moltke, Irina Pugach, Thorfinn Sand Korneliussen, Ivan P. Levkivskyi, José Víctor Moreno-Mayar, Shengyu Ni, Fernando Racimo, Martin Sikora, Yali Xue, Farhang A. Aghakhanian, Nicolas Brucato, Søren Brunak, Paula F. Campos, Warren Clark, Sturla Ellingvåg, Gudjugudju Fourmile, Pascale Gerbault, Darren Injie, George Koki, Matthew Leavesley, Betty Logan, Aubrey Lynch, Elizabeth A. Matisoo-Smith, Peter J. McAllister, Alexander J. Mentzer, Mait Metspalu, Andrea B. Migliano, Les Murgha, Maude E. Phipps, William Pomat, Doc Reynolds, Francois-Xavier Ricaut, Peter Siba, Mark G. Thomas, Thomas Wales, Colleen Ma'run Wall, Stephen J. Oppenheimer, Chris Tyler-Smith, Richard Durbin, Joe Dortch, Andrea Manica, Mikkel H. Schierup, Robert A. Foley, Marta Mirazón Lahr, Claire Bowern, Jeffrey D. Wall, Thomas Mailund, Mark Stoneking, Rasmus Nielsen, Manjinder S. Sandhu, Laurent Excoffier, David M. Lambert, Eske Willerslev:
A genomic history of Aboriginal Australia. Nat. 538(7624): 207-214 (2016) - [j25]Edzer J. Pebesma, Thomas Mailund, James Hiebert:
Measurement Units in R. R J. 8(2): 486 (2016) - 2015
- [j24]Jade Yu Cheng, Thomas Mailund:
Ancestral population genomics using coalescence hidden Markov models and heuristic optimisation algorithms. Comput. Biol. Chem. 57: 80-92 (2015) - 2014
- [j23]Andreas Sand, Morten Kragelund Holt, Jens Johansen, Gerth Stølting Brodal, Thomas Mailund, Christian N. S. Pedersen:
tqDist: a library for computing the quartet and triplet distances between binary or general trees. Bioinform. 30(14): 2079-2080 (2014) - [j22]Yu Qian, Søren Besenbacher, Thomas Mailund, Mikkel Heide Schierup:
Identifying disease associated genes by network propagation. BMC Syst. Biol. 8(S-1): S6 (2014) - 2013
- [j21]Andreas Sand, Martin Kristiansen, Christian N. S. Pedersen, Thomas Mailund:
zipHMMlib: a highly optimised HMM library exploiting repetitions in the input to speed up the forward algorithm. BMC Bioinform. 14: 339 (2013) - [j20]Andreas Sand, Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Thomas Mailund:
A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees. BMC Bioinform. 14(S-2): S18 (2013) - [c17]Gerth Stølting Brodal, Rolf Fagerberg, Thomas Mailund, Christian N. S. Pedersen, Andreas Sand:
Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree. SODA 2013: 1814-1832 - 2012
- [j19]Kurt Jensen, Lars Michael Kristensen, Thomas Mailund:
The sweep-line state space exploration method. Theor. Comput. Sci. 429: 169-179 (2012) - [c16]Thomas Mailund, Anders E. Halager, Michael Westergaard:
Using Colored Petri Nets to Construct Coalescent Hidden Markov Models: Automatic Translation from Demographic Specifications to Efficient Inference Methods. Petri Nets 2012: 32-50 - 2011
- [j18]Jesper Buus Nielsen, Anders K. Kristensen, Thomas Mailund, Christian N. S. Pedersen:
A sub-cubic time algorithm for computing the quartet distance between two general trees. Algorithms Mol. Biol. 6: 15 (2011) - 2010
- [c15]Martin Simonsen, Thomas Mailund, Christian N. S. Pedersen:
Building Very Large Neighbour-joining Trees. BIOINFORMATICS 2010: 26-32 - [c14]Martin Simonsen, Thomas Mailund, Christian N. S. Pedersen:
Inference of Large Phylogenies Using Neighbour-Joining. BIOSTEC (Selected Papers) 2010: 334-344
2000 – 2009
- 2009
- [j17]Søren Besenbacher, Christian N. S. Pedersen, Thomas Mailund:
A fast algorithm for genome-wide haplotype pattern mining. BMC Bioinform. 10(S-1) (2009) - [c13]Thomas Mailund, Jesper Buus Nielsen, Christian N. S. Pedersen:
A Quadratic Time Algorithm for Computing the Quartet Distance between Two General Trees. IJCBS 2009: 565-568 - 2008
- [j16]Zhihong Ding, Thomas Mailund, Yun S. Song:
Efficient whole-genome association mapping using local phylogenies for unphased genotype data. Bioinform. 24(19): 2215-2221 (2008) - [j15]Saskia de Groot, Thomas Mailund, Gerton Lunter, Jotun Hein:
Investigating selection on viruses: a statistical alignment approach. BMC Bioinform. 9 (2008) - [j14]Jesper Buus Nielsen, Thomas Mailund:
SNPFile - A software library and file format for large scale association mapping and population genetics studies. BMC Bioinform. 9 (2008) - [j13]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. Bioinform. Comput. Biol. 6(1): 37-50 (2008) - [c12]Martin Simonsen, Thomas Mailund, Christian N. S. Pedersen:
Rapid Neighbour-Joining. WABI 2008: 113-122 - 2007
- [j12]Saskia de Groot, Thomas Mailund, Jotun Hein:
Comparative annotation of viral genomes with non-conserved gene structure. Bioinform. 23(9): 1080-1089 (2007) - [j11]Stephen McCauley, Saskia de Groot, Thomas Mailund, Jotun Hein:
Annotation of selection strengths in viral genomes. Bioinform. 23(22): 2978-2986 (2007) - [j10]Thomas Mailund, Christian N. S. Pedersen, Jonas Bardino, Brian Vinter, Henrik Hoey Karlsen:
Experiences with GeneRecon on MiG. Future Gener. Comput. Syst. 23(4): 580-586 (2007) - [c11]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 - [c10]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 - 2006
- [j9]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 Mol. Biol. 1 (2006) - [j8]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. Bioinform. 22(18): 2317-2318 (2006) - [j7]Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Derek Phillips:
Recrafting the neighbor-joining method. BMC Bioinform. 7: 29 (2006) - [j6]Thomas Mailund, Søren Besenbacher, Mikkel H. Schierup:
Whole genome association mapping by incompatibilities and local perfect phylogenies. BMC Bioinform. 7: 454 (2006) - 2005
- [j5]Søren Besenbacher, Thomas Mailund, Lasse Westh-Nielsen, Christian N. S. Pedersen:
RBT - a tool for building refined Buneman trees. Bioinform. 21(8): 1711-1712 (2005) - [j4]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 Bioinform. 6: 252 (2005) - [c9]Thomas Mailund, Christian N. S. Pedersen, Jonas Bardino, Brian Vinter, Henrik Hoey Karlsen:
Initial Experiences with GeneRecon on MiG. GCA 2005: 141-146 - [c8]Chris Christiansen, Thomas Mailund, Christian N. S. Pedersen, Martin Randers:
Computing the Quartet Distance Between Trees of Arbitrary Degree. WABI 2005: 77-88 - 2004
- [j3]Thomas Mailund, Christian N. S. Pedersen:
QDist-quartet distance between evolutionary trees. Bioinform. 20(10): 1636-1637 (2004) - [j2]Thomas Mailund, Christian N. S. Pedersen:
QuickJoin - fast neighbour-joining tree reconstruction. Bioinform. 20(17): 3261-3262 (2004) - [j1]Jonathan Billington, Guy Edward Gallasch, Lars Michael Kristensen, Thomas Mailund:
Exploiting equivalence reduction and the sweep-line method for detecting terminal states. IEEE Trans. Syst. Man Cybern. Part A 34(1): 23-37 (2004) - [c7]Thomas Mailund, Michael Westergaard:
Obtaining Memory-Efficient Reachability Graph Representations Using the Sweep-Line Method. TACAS 2004: 177-191 - 2003
- [c6]Lars Michael Kristensen, Thomas Mailund:
Efficient Path Finding with the Sweep-Line Method Using External Storage. ICFEM 2003: 319-337 - 2002
- [c5]Thomas Mailund:
Analysing Infinite-State Systems by Combining Equivalence Reduction and the Sweep-Line Method. ICATPN 2002: 314-334 - [c4]Lars Michael Kristensen, Thomas Mailund:
A Generalised Sweep-Line Method for Safety Properties. FME 2002: 549-567 - [c3]Lars Michael Kristensen, Thomas Mailund:
A Compositional Sweep-Line State Space Exploration Method. FORTE 2002: 327-343 - 2001
- [c2]Søren Christensen, Lars Michael Kristensen, Thomas Mailund:
Condensed State Spaces for Timed Petri Nets. ICATPN 2001: 101-120 - [c1]Søren Christensen, Lars Michael Kristensen, Thomas Mailund:
A Sweep-Line Method for State Space Exploration. TACAS 2001: 450-464
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
