The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Christian N. S. Pedersen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  29. Rapid Neighbour-Joining. [Citation Graph (, )][DBLP]


  30. A Tree Based Method for the Rapid Screening of Chemical Fingerprints. [Citation Graph (, )][DBLP]


  31. Data Structures for Accelerating Tanimoto Queries on Real Valued Vectors. [Citation Graph (, )][DBLP]


  32. A fast algorithm for genome-wide haplotype pattern mining. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002