Christian N. S. Pedersen

Affiliations:
  • Aarhus University, Bioinformatics Research Center


According to our database1, Christian N. S. Pedersen authored at least 55 papers between 1998 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
Benchmarking the HLA typing performance of Polysolver and Optitype in 50 Danish parental trios.
BMC Bioinform., 2018

2017
Sequencing and <i>de novo</i> assembly of 150 genomes from Denmark as a population reference.
Nat., 2017

Prediction of Primary Tumors in Cancers of Unknown Primary.
J. Integr. Bioinform., 2017

2016
Computational discovery of specificity-conferring sites in non-ribosomal peptide synthetases.
Bioinform., 2016

2014
tqDist: a library for computing the quartet and triplet distances between binary or general trees.
Bioinform., 2014

2013
GPU-Accelerated High-Accuracy Molecular Docking Using Guided Differential Evolution.
Proceedings of the Massively Parallel Evolutionary Computation on GPGPUs, 2013

Characterising RNA secondary structure space using information entropy.
BMC Bioinform., 2013

zipHMMlib: a highly optimised HMM library exploiting repetitions in the input to speed up the forward algorithm.
BMC Bioinform., 2013

A practical O(n log<sup>2 </sup> n) time algorithm for computing the triplet distance on binary trees.
BMC Bioinform., 2013

Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012
PPfold 3.0: fast RNA secondary structure prediction using phylogeny and auxiliary data.
Bioinform., 2012

UniMoG - a unifying framework for genomic distance calculation and sorting based on DCJ.
Bioinform., 2012

<i>shortran</i>: a pipeline for small RNA-seq data analysis.
Bioinform., 2012

2011
Molecular Docking with Ligand Attached Water Molecules.
J. Chem. Inf. Model., 2011

Using Inverted Indices for Accelerating LINGO Calculations.
J. Chem. Inf. Model., 2011

A sub-cubic time algorithm for computing the quartet distance between two general trees.
Algorithms Mol. Biol., 2011

Rapid computation of distance estimators from nucleotide and amino acid alignments.
Proceedings of the 2011 ACM Symposium on Applied Computing (SAC), TaiChung, Taiwan, March 21, 2011

GPU-accelerated high-accuracy molecular docking using guided differential evolution: real world applications.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

2010
A tree-based method for the rapid screening of chemical fingerprints.
Algorithms Mol. Biol., 2010

Data Structures for Accelerating Tanimoto Queries on Real Valued Vectors.
Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010

Inference of Large Phylogenies Using Neighbour-Joining.
Proceedings of the Biomedical Engineering Systems and Technologies, 2010

Building Very Large Neighbour-joining Trees.
Proceedings of the BIOINFORMATICS 2010, 2010

2009
A fast algorithm for genome-wide haplotype pattern mining.
BMC Bioinform., 2009

A Quadratic Time Algorithm for Computing the Quartet Distance between Two General Trees.
Proceedings of the International Joint Conferences on Bioinformatics, 2009

Optimal Overlay of Ligands with Flexible Bonds Using Differential Evolution.
Proceedings of the International Joint Conferences on Bioinformatics, 2009

2008
Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees.
J. Bioinform. Comput. Biol., 2008

Rapid Neighbour-Joining.
Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

2007
Experiences with GeneRecon on MiG.
Future Gener. Comput. Syst., 2007

Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree.
Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

2006
Recrafting the neighbor-joining method.
BMC Bioinform., 2006

GeneRecon - a coalescent based tool for fine-scale association mapping.
Bioinform., 2006

Fast calculation of the quartet distance between trees of arbitrary degrees.
Algorithms Mol. Biol., 2006

2005
CoaSim: A flexible environment for simulating genetic data under coalescent models.
BMC Bioinform., 2005

RBT - a tool for building refined Buneman trees.
Bioinform., 2005

Computing the Quartet Distance Between Trees of Arbitrary Degree.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

Initial Experiences with GeneRecon on MiG.
Proceedings of The 2005 International Conference on Grid Computing and Applications, 2005

2004
QuickJoin - fast neighbour-joining tree reconstruction.
Bioinform., 2004

QDist-quartet distance between evolutionary trees.
Bioinform., 2004

Computing the Quartet Distance between Evolutionary Trees in Time O(n log n).
Algorithmica, 2004

2003
Computing Refined Buneman Trees in Cubic Time.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

2002
The consensus string problem and the complexity of comparing hidden Markov models.
J. Comput. Syst. Sci., 2002

Comparative Methods for Gene Structure Prediction in Homologous Sequences.
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Solving the String Statistics Problem in Time O(n log n).
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001
Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar.
Proceedings of the Algorithms in Bioinformatics, First International Workshop, 2001

Complexity of Comparing Hidden Markov Models.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Computing the Quartet Distance between Evolutionary Trees in Time O(n log<sup>2</sup> n).
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

The Complexity of Constructing Evolutionary Trees Using Experiments.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
RNA Pseudoknot Prediction in Energy-Based Models.
J. Comput. Biol., 2000

Pseudoknots in RNA secondary structures.
Proceedings of the Fourth Annual International Conference on Computational Molecular Biology, 2000

Finding Maximal Quasiperiodicities in Strings.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

1999
Fast evaluation of internal loops in RNA secondary structure prediction.
Bioinform., 1999

Internal loops in RNA secondary structure prediction.
Proceedings of the Third Annual International Conference on Research in Computational Molecular Biology, 1999

Metrics and Similarity Measures for Hidden Markov Models.
Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology, 1999

Finding Maximal Pairs with Bounded Gap.
Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

1998
Comparison of Coding DNA.
Proceedings of the Combinatorial Pattern Matching, 9th Annual Symposium, 1998


  Loading...