Christian N. S. Pedersen

Christian Nørgaard Storm Pedersen

Aarhus University, Bioinformatics Research Center

	2013
c26		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		Rolf Hilker, Corinna Sickinger, Christian N. S. Pedersen, Jens Stoye: UniMoG - a unifying framework for genomic distance calculation and sorting based on DCJ. Bioinformatics 28(19): 2509-2511 (2012)
j18		Zsuzsanna Sükösd, Bjarne Knudsen, Jørgen Kjems, Christian N. S. Pedersen: PPfold 3.0: fast RNA secondary structure prediction using phylogeny and auxiliary data. Bioinformatics 28(20): 2691-2692 (2012)
j17		Vikas Gupta, Katharina Markmann, Christian N. S. Pedersen, Jens Stougaard, Stig U. Andersen: shortran: a pipeline for small RNA-seq data analysis. Bioinformatics 28(20): 2698-2700 (2012)
	2011
j16		Jesper 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 for Molecular Biology 6: 15 (2011)
c25		Martin Simonsen, Christian N. S. Pedersen, Mikael H. Christensen, René Thomsen: GPU-accelerated high-accuracy molecular docking using guided differential evolution: real world applications. GECCO 2011: 1803-1810
c24		Martin Simonsen, Christian N. S. Pedersen: Rapid computation of distance estimators from nucleotide and amino acid alignments. SAC 2011: 89-93
	2010
j15		Thomas Greve Kristensen, Jesper Nielsen, Christian N. S. Pedersen: A tree-based method for the rapid screening of chemical fingerprints. Algorithms for Molecular Biology 5: 9 (2010)
c23		Martin Simonsen, Thomas Mailund, Christian N. S. Pedersen: Building Very Large Neighbour-joining Trees. BIOINFORMATICS 2010: 26-32
c22		Thomas Greve Kristensen, Christian N. S. Pedersen: Data Structures for Accelerating Tanimoto Queries on Real Valued Vectors. WABI 2010: 28-39
	2009
j14		Søren Besenbacher, Christian N. S. Pedersen, Thomas Mailund: A fast algorithm for genome-wide haplotype pattern mining. BMC Bioinformatics 10(S-1) (2009)
c21		Thomas Greve Kristensen, Christian N. S. Pedersen: Optimal Overlay of Ligands with Flexible Bonds Using Differential Evolution. IJCBS 2009: 331-334
c20		Thomas Mailund, Jesper Nielsen, Christian N. S. Pedersen: A Quadratic Time Algorithm for Computing the Quartet Distance between Two General Trees. IJCBS 2009: 565-568
c19		Thomas Greve Kristensen, Jesper Nielsen, Christian N. S. Pedersen: A Tree Based Method for the Rapid Screening of Chemical Fingerprints. WABI 2009: 194-205
	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. Bioinformatics and Computational Biology 6(1): 37-50 (2008)
c18		Martin Simonsen, Thomas Mailund, Christian N. S. Pedersen: Rapid Neighbour-Joining. WABI 2008: 113-122
	2007
j12		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)
c17		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
c16		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
j11		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)
j10		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)
j9		Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Derek Phillips: Recrafting the neighbor-joining method. BMC Bioinformatics 7: 29 (2006)
	2005
j8		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)
j7		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)
c15		Thomas Mailund, Christian N. S. Pedersen, Jonas Bardino, Brian Vinter, Henrik Hoey Karlsen: Initial Experiences with GeneRecon on MiG. GCA 2005: 141-146
c14		Chris Christiansen, Thomas Mailund, Christian N. S. Pedersen, Martin Randers: Computing the Quartet Distance Between Trees of Arbitrary Degree. WABI 2005: 77-88
	2004
j6		Thomas Mailund, Christian N. S. Pedersen: QDist-quartet distance between evolutionary trees. Bioinformatics 20(10): 1636-1637 (2004)
j5		Thomas Mailund, Christian N. S. Pedersen: QuickJoin - fast neighbour-joining tree reconstruction. Bioinformatics 20(17): 3261-3262 (2004)
	2003
j4		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)
c13		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
	2002
j3		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)
c12		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
c11		Christian N. S. Pedersen, Tejs Scharling: Comparative Methods for Gene Structure Prediction in Homologous Sequences. WABI 2002: 220-234
	2001
c10		Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Anna Östlin: The Complexity of Constructing Evolutionary Trees Using Experiments. ICALP 2001: 140-151
c9		Rune B. Lyngsø, Christian N. S. Pedersen: Complexity of Comparing Hidden Markov Models. ISAAC 2001: 416-428
c8		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
c7		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
j2		Rune B. Lyngsø, Christian N. S. Pedersen: RNA Pseudoknot Prediction in Energy-Based Models. Journal of Computational Biology 7(3-4): 409-427 (2000)
c6		Gerth Stølting Brodal, Christian N. S. Pedersen: Finding Maximal Quasiperiodicities in Strings. CPM 2000: 397-411
c5		Rune B. Lyngsø, Christian N. S. Pedersen: Pseudoknots in RNA secondary structures. RECOMB 2000: 201-209
	1999
j1		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)
c4		Gerth Stølting Brodal, Rune B. Lyngsø, Christian N. S. Pedersen, Jens Stoye: Finding Maximal Pairs with Bounded Gap. CPM 1999: 134-149
c3		Rune B. Lyngsø, Christian N. S. Pedersen, Henrik Nielsen: Metrics and Similarity Measures for Hidden Markov Models. ISMB 1999: 178-186
c2		Rune B. Lyngsø, Michael Zuker, Christian N. S. Pedersen: Internal loops in RNA secondary structure prediction. RECOMB 1999: 260-267
	1998
c1		Christian N. S. Pedersen, Rune B. Lyngsø, Jotun Hein: Comparison of Coding DNA. CPM 1998: 153-173

Coauthor Index

Last update Mon May 20 23:27:01 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page