dblp.uni-trier.dewww.uni-trier.de

Christian N. S. Pedersen

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
30EEMartin Simonsen, Thomas Mailund, Christian N. S. Pedersen: Rapid Neighbour-Joining. WABI 2008: 113-122
29EEM. 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
28EEM. 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
27EEM. 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
26EEThomas 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
25EEThomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Derek Phillips: Recrafting the neighbor-joining method. BMC Bioinformatics 7: 29 (2006)
24EEThomas 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
22EEChris Christiansen, Thomas Mailund, Christian N. S. Pedersen, Martin Randers: Computing the Quartet Distance Between Trees of Arbitrary Degree. WABI 2005: 77-88
21EEThomas 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)
20EESø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
19EEThomas Mailund, Christian N. S. Pedersen: QDist-quartet distance between evolutionary trees. Bioinformatics 20(10): 1636-1637 (2004)
18EEThomas Mailund, Christian N. S. Pedersen: QuickJoin - fast neighbour-joining tree reconstruction. Bioinformatics 20(17): 3261-3262 (2004)
2003
17EEGerth 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
16EEGerth 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
15EEGerth 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
14EEChristian N. S. Pedersen, Tejs Scharling: Comparative Methods for Gene Structure Prediction in Homologous Sequences. WABI 2002: 220-234
13EERune 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
12EEGerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Anna Östlin: The Complexity of Constructing Evolutionary Trees Using Experiments. ICALP 2001: 140-151
11EERune B. Lyngsø, Christian N. S. Pedersen: Complexity of Comparing Hidden Markov Models. ISAAC 2001: 416-428
10EEGerth 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
9EEArun 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
8EEGerth Stølting Brodal, Christian N. S. Pedersen: Finding Maximal Quasiperiodicities in Strings. CPM 2000: 397-411
7EERune 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
5EEGerth 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
3EERune 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

Coauthor Index

1Jonas Bardino [23] [26]
2Søren Besenbacher [20]
3Gerth Stølting Brodal [5] [8] [10] [12] [15] [16] [17] [25] [27] [28] [29]
4Chris Christiansen [22]
5Rolf Fagerberg [10] [12] [16] [17] [25] [27] [28] [29]
6Jotun Hein [1] [24]
7Arun K. Jagota [9]
8Henrik Hoey Karlsen [23] [26]
9Rune B. Lyngsø [1] [2] [3] [4] [5] [6] [7] [9] [11] [13] [15]
10Jesper N. Madsen [21] [24]
11Thomas Mailund [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30]
12Peter J. M. Mechlenborg [21]
13Henrik Nielsen [4]
14Anna Pagh (Anna Östlin) [12] [15] [17]
15Derek Phillips [25]
16Martin Randers [22]
17S. Srinivasa Rao (Srinivasa Rao Satti) [17]
18Tejs Scharling [14]
19Leif Schauser [21] [24]
20Mikkel H. Schierup [21] [24]
21Martin Simonsen [30]
22M. Stissing [27] [28] [29]
23Jens Stoye [5]
24Brian Vinter [23] [26]
25Lasse Westh-Nielsen [20]
26Michael Zuker [2] [3]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)