( en | de | ru )

 

Disambiguation of "Swenson, Krister M."

Author of the publication

copydeleteadd this publication to your clipboard
Uncovering Hidden Phylogenetic Consensus.

, , and . ISBRA, volume 6053 of Lecture Notes in Computer Science, page 128-139. Springer, (2010)

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.

Krister Helbing

Krister Bergmann

Krister Volkmann

Krister Jehmlich

Ulf Krister Hofmann

 

Other publications of authors with the same name

Evaluating impacts of syntenic block detection strategies on rearrangement phylogeny using Mycobacterium tuberculosis isolates., , , and . Bioinform., (January 2023)On the Comparison of Sets of Alternative Transcripts., , and . ISBRA, volume 7292 of Lecture Notes in Computer Science, page 201-212. Springer, (2012)Uncovering Hidden Phylogenetic Consensus., , and . ISBRA, volume 6053 of Lecture Notes in Computer Science, page 128-139. Springer, (2010)Rapidly Computing the Phylogenetic Transfer Index., , and . WABI, volume 143 of LIPIcs, page 20:1-20:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Phylogenetic Reconstruction from Complete Gene Orders of Whole Genomes., , , and . APBC, volume 6 of Advances in Bioinformatics and Computational Biology, page 241-250. Imperial College Press, (2008)Quantifying Hierarchical Conflicts in Homology Statements., , , , and . RECOMB-CG, volume 13234 of Lecture Notes in Computer Science, page 146-167. Springer, (2022)Listing All Parsimonious Reversal Sequences: New Algorithms and Perspectives., , and . RECOMB-CG, volume 6398 of Lecture Notes in Computer Science, page 39-49. Springer, (2010)Listing All Parsimonious Reversal Sequences: New Algorithms and Perspectives., , and . J. Comput. Biol., 18 (9): 1201-1210 (2011)Evolution of whole genomes through inversions - models and algorithms for duplicates, ancestors, and edit scenarios.. EPFL, Switzerland, (2009)Sorting Signed Permutations by Inversions in O(nlogn) Time., , , and . RECOMB, volume 5541 of Lecture Notes in Computer Science, page 386-399. Springer, (2009)