2008 |
30 | EE | Martin Simonsen,
Thomas Mailund,
Christian N. S. Pedersen:
Rapid Neighbour-Joining.
WABI 2008: 113-122 |
29 | EE | M. 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 |
28 | EE | M. 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 |
27 | EE | M. 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 |
26 | EE | 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 |
25 | EE | Thomas Mailund,
Gerth Stølting Brodal,
Rolf Fagerberg,
Christian N. S. Pedersen,
Derek Phillips:
Recrafting the neighbor-joining method.
BMC Bioinformatics 7: 29 (2006) |
24 | EE | 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 |
23 | | Thomas Mailund,
Christian N. S. Pedersen,
Jonas Bardino,
Brian Vinter,
Henrik Hoey Karlsen:
Initial Experiences with GeneRecon on MiG.
GCA 2005: 141-146 |
22 | EE | Chris Christiansen,
Thomas Mailund,
Christian N. S. Pedersen,
Martin Randers:
Computing the Quartet Distance Between Trees of Arbitrary Degree.
WABI 2005: 77-88 |
21 | EE | 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) |
20 | EE | 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 |
19 | EE | Thomas Mailund,
Christian N. S. Pedersen:
QDist-quartet distance between evolutionary trees.
Bioinformatics 20(10): 1636-1637 (2004) |
18 | EE | Thomas Mailund,
Christian N. S. Pedersen:
QuickJoin - fast neighbour-joining tree reconstruction.
Bioinformatics 20(17): 3261-3262 (2004) |
2003 |
17 | EE | Gerth Stølting Brodal,
Rolf Fagerberg,
Anna Östlin,
Christian N. S. Pedersen,
S. Srinivasa Rao:
Computing Refined Buneman Trees in Cubic Time.
WABI 2003: 259-270 |
16 | EE | Gerth Stølting Brodal,
Rolf Fagerberg,
Christian N. S. Pedersen:
Computing the Quartet Distance between Evolutionary Trees in Time O(n log n).
Algorithmica 38(2): 377-395 (2003) |
2002 |
15 | EE | Gerth Stølting Brodal,
Rune B. Lyngsø,
Anna Östlin,
Christian N. S. Pedersen:
Solving the String Statistics Problem in Time O(n log n).
ICALP 2002: 728-739 |
14 | EE | Christian N. S. Pedersen,
Tejs Scharling:
Comparative Methods for Gene Structure Prediction in Homologous Sequences.
WABI 2002: 220-234 |
13 | EE | Rune B. Lyngsø,
Christian N. S. Pedersen:
The consensus string problem and the complexity of comparing hidden Markov models.
J. Comput. Syst. Sci. 65(3): 545-569 (2002) |
2001 |
12 | EE | Gerth Stølting Brodal,
Rolf Fagerberg,
Christian N. S. Pedersen,
Anna Östlin:
The Complexity of Constructing Evolutionary Trees Using Experiments.
ICALP 2001: 140-151 |
11 | EE | Rune B. Lyngsø,
Christian N. S. Pedersen:
Complexity of Comparing Hidden Markov Models.
ISAAC 2001: 416-428 |
10 | EE | Gerth Stølting Brodal,
Rolf Fagerberg,
Christian N. S. Pedersen:
Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n).
ISAAC 2001: 731-742 |
9 | EE | Arun K. Jagota,
Rune B. Lyngsø,
Christian N. S. Pedersen:
Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar.
WABI 2001: 69-94 |
2000 |
8 | EE | Gerth Stølting Brodal,
Christian N. S. Pedersen:
Finding Maximal Quasiperiodicities in Strings.
CPM 2000: 397-411 |
7 | EE | Rune B. Lyngsø,
Christian N. S. Pedersen:
Pseudoknots in RNA secondary structures.
RECOMB 2000: 201-209 |
6 | | Rune B. Lyngsø,
Christian N. S. Pedersen:
RNA Pseudoknot Prediction in Energy-Based Models.
Journal of Computational Biology 7(3-4): 409-427 (2000) |
1999 |
5 | EE | Gerth Stølting Brodal,
Rune B. Lyngsø,
Christian N. S. Pedersen,
Jens Stoye:
Finding Maximal Pairs with Bounded Gap.
CPM 1999: 134-149 |
4 | | Rune B. Lyngsø,
Christian N. S. Pedersen,
Henrik Nielsen:
Metrics and Similarity Measures for Hidden Markov Models.
ISMB 1999: 178-186 |
3 | EE | Rune B. Lyngsø,
Michael Zuker,
Christian N. S. Pedersen:
Internal loops in RNA secondary structure prediction.
RECOMB 1999: 260-267 |
2 | | Rune B. Lyngsø,
Michael Zuker,
Christian N. S. Pedersen:
Fast evaluation of internal loops in RNA secondary structure prediction.
Bioinformatics 15(6): 440-445 (1999) |
1998 |
1 | | Christian N. S. Pedersen,
Rune B. Lyngsø,
Jotun Hein:
Comparison of Coding DNA.
CPM 1998: 153-173 |