( en | de | ru )

 

Disambiguation of "Pedersen, Christian N. S."

Author of the publication

copydeleteadd this publication to your clipboard
Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree.

, , , , and . SODA, page 1814-1832. SIAM, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

S N Chillrud

n-s Yi

Hy n-s Yi

Hy n-s Pak

n n n

 

Other publications of authors with the same name

Solving the String Statistics Problem in Time O(n log n)., , , and . ICALP, volume 2380 of Lecture Notes in Computer Science, page 728-739. Springer, (2002)shortran: a pipeline for small RNA-seq data analysis., , , , and . Bioinform., 28 (20): 2698-2700 (2012)Computing the Quartet Distance Between Trees of Arbitrary Degree., , , and . WABI, volume 3692 of Lecture Notes in Computer Science, page 77-88. Springer, (2005)Initial Experiences with GeneRecon on MiG., , , , and . GCA, page 141-146. CSREA Press, (2005)Building Very Large Neighbour-joining Trees., , and . BIOINFORMATICS, page 26-32. INSTICC Press, (2010)tqDist: a library for computing the quartet and triplet distances between binary or general trees., , , , , and . Bioinform., 30 (14): 2079-2080 (2014)Inference of Large Phylogenies Using Neighbour-Joining., , and . BIOSTEC (Selected Papers), volume 127 of Communications in Computer and Information Science, page 334-344. Springer, (2010)A sub-cubic time algorithm for computing the quartet distance between two general trees., , , and . Algorithms Mol. Biol., (2011)The consensus string problem and the complexity of comparing hidden Markov models., and . J. Comput. Syst. Sci., 65 (3): 545-569 (2002)Finding Maximal Pairs with Bounded Gap., , , and . CPM, volume 1645 of Lecture Notes in Computer Science, page 134-149. Springer, (1999)