( en | de | ru )

 

Disambiguation of "Mailund, Thomas"

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.

Thomas Thomas

Thomas Baron

Untersuchungen an ungeschädigten und durch Pilzbefall geschädigten Nadelholzbauteilen mit ausgewählten Prüfverfahren. TU Dresden, (2009)

Thomas Harasim

Die Rolle des nucleostemin-Gens in dem Prozess der Ribosomenbiogenese. Uni München, (2009)

Thomas Böttcher

Naturstoffe und ihre Derivate als molekulare Sonden: Identifikation ihrer Angriffsziele und Inhibition der Virulenz in pathogenen Bakterien. Uni München, (2009)

Thomas Potinecke

Methode zur Systematisierung von Teilprozessen in der Produktentwicklung beim Einsatz von CAx-Technologien. Uni Stuttgart, (2009)
 

Other publications of authors with the same name

SNPFile - A software library and file format for large scale association mapping and population genetics studies., and . BMC Bioinform., (2008)Computing the Quartet Distance Between Trees of Arbitrary Degree., , , and . WABI, volume 3692 of Lecture Notes in Computer Science, page 77-88. Springer, (2005)zipHMMlib: a highly optimised HMM library exploiting repetitions in the input to speed up the forward algorithm., , , and . BMC Bioinform., (2013)The Beginner's Guide to Markdown and Pandoc. Independently published, (2019)Experiences with GeneRecon on MiG., , , , and . Future Gener. Comput. Syst., 23 (4): 580-586 (2007)QDist-quartet distance between evolutionary trees., and . Bioinform., 20 (10): 1636-1637 (2004)Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree., , , , and . APBC, volume 5 of Advances in Bioinformatics and Computational Biology, page 101-110. Imperial College Press, (2007)A Quadratic Time Algorithm for Computing the Quartet Distance between Two General Trees., , and . IJCBS, page 565-568. IEEE Computer Society, (2009)Rapid Neighbour-Joining., , and . WABI, volume 5251 of Lecture Notes in Computer Science, page 113-122. Springer, (2008)Efficient Path Finding with the Sweep-Line Method Using External Storage., and . ICFEM, volume 2885 of Lecture Notes in Computer Science, page 319-337. Springer, (2003)