Krister M. Swenson

Orcid: 0000-0001-8690-1261

According to our database1, Krister M. Swenson authored at least 52 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Simple and Efficient Algorithm for Sorting Signed Permutations by Reversals.
CoRR, 2024

2023
Evaluating impacts of syntenic block detection strategies on rearrangement phylogeny using <i>Mycobacterium tuberculosis</i> isolates.
Bioinform., January, 2023

Two Strikes Against the Phage Recombination Problem.
Proceedings of the Comparative Genomics - 20th International Conference, 2023

2022
Quantifying Hierarchical Conflicts in Homology Statements.
Proceedings of the Comparative Genomics - 19th International Conference, 2022

On the Comparison of Bacteriophage Populations.
Proceedings of the Comparative Genomics - 19th International Conference, 2022

2021
A Faster Algorithm for Computing the Kernel of Maximum Agreement Subtrees.
IEEE ACM Trans. Comput. Biol. Bioinform., 2021

2019
Large-scale mammalian genome rearrangements coincide with chromatin interactions.
Bioinform., 2019

Rapid alignment-free phylogenetic identification of metagenomic sequences.
Bioinform., 2019

A general framework for genome rearrangement with biological constraints.
Algorithms Mol. Biol., 2019

Rapidly Computing the Phylogenetic Transfer Index.
Proceedings of the 19th International Workshop on Algorithms in Bioinformatics, 2019

Weighted Minimum-Length Rearrangement Scenarios.
Proceedings of the 19th International Workshop on Algorithms in Bioinformatics, 2019

2018
A framework for cost-constrained genome rearrangement under Double Cut and Join.
CoRR, 2018

Finding local genome rearrangements.
Algorithms Mol. Biol., 2018

2017
Rearrangement Scenarios Guided by Chromatin Structure.
Proceedings of the Comparative Genomics - 15th International Workshop, 2017

2016
Aligning the unalignable: bacteriophage whole genome alignments.
BMC Bioinform., 2016

Models and algorithms for genome rearrangement with positional constraints.
Algorithms Mol. Biol., 2016

2015
Models and Algorithms for Genome Rearrangement with Positional Constraints.
Proceedings of the Algorithms in Bioinformatics - 15th International Workshop, 2015

2014
Gene tree correction for reconciliation and species tree inference: Complexity and algorithms.
J. Discrete Algorithms, 2014

2013
Ancestral Genome Organization: An Alignment Approach.
J. Comput. Biol., 2013

Reconstructing the modular recombination history of Staphylococcus aureus phages.
BMC Bioinform., 2013

Gene tree correction guided by orthology.
BMC Bioinform., 2013

Error Detection and Correction of Gene Trees.
Proceedings of the Models and Algorithms for Genome Evolution, 2013

2012
The Kernel of Maximum Agreement Subtrees.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

Gene trees and species trees: irreconcilable differences.
BMC Bioinform., 2012

A graph-theoretic approach for inparalog detection.
BMC Bioinform., 2012

Gene tree correction for reconciliation and species tree inference.
Algorithms Mol. Biol., 2012

An Optimal Reconciliation Algorithm for Gene Trees with Polytomies.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

Evolution of Genome Organization by Duplication and Loss: An Alignment Approach.
Proceedings of the Research in Computational Molecular Biology, 2012

On the Comparison of Sets of Alternative Transcripts.
Proceedings of the Bioinformatics Research and Applications - 8th International Symposium, 2012

2011
Uncovering Hidden Phylogenetic Consensus in Large Data Sets.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011

A 2-Approximation for the Minimum Duplication Speciation Problem.
J. Comput. Biol., 2011

Theory and Practice of Ultra-Perfection.
J. Comput. Biol., 2011

Listing All Parsimonious Reversal Sequences: New Algorithms and Perspectives.
J. Comput. Biol., 2011

Listing all sorting reversals in quadratic time.
Algorithms Mol. Biol., 2011

OMG! Orthologs in Multiple Genomes - Competing Graph-Theoretical Formulations.
Proceedings of the Algorithms in Bioinformatics - 11th International Workshop, 2011

2010
The Metropolized Partial Importance Sampling MCMC Mixes Slowly on Minimum Reversal Rearrangement Paths.
IEEE ACM Trans. Comput. Biol. Bioinform., 2010

Sorting Signed Permutations by Inversions in <i>O</i>(<i>n</i>log<i>n</i>) Time.
J. Comput. Biol., 2010

Heuristics for the inversion median problem.
BMC Bioinform., 2010

Estimating true evolutionary distances under rearrangements, duplications, and losses.
BMC Bioinform., 2010

An Approximation Algorithm for Computing a Parsimonious First Speciation in the Gene Duplication Model.
Proceedings of the Comparative Genomics - International Workshop, 2010

Ultra-Perfect Sorting Scenarios.
Proceedings of the Comparative Genomics - International Workshop, 2010

Uncovering Hidden Phylogenetic Consensus.
Proceedings of the Bioinformatics Research and Applications, 6th International Symposium, 2010

2009
Evolution of whole genomes through inversions - models and algorithms for duplicates, ancestors, and edit scenarios.
PhD thesis, 2009

Hurdles and Sorting by Inversions: Combinatorial, Statistical, and Experimental Results.
J. Comput. Biol., 2009

Maximum independent sets of commuting and noninterfering inversions.
BMC Bioinform., 2009

Inversion-based genomic signatures.
BMC Bioinform., 2009

Sorting Signed Permutations by Inversions in O(nlogn) Time.
Proceedings of the Research in Computational Molecular Biology, 2009

2008
Approximating the true evolutionary distance between two genomes.
ACM J. Exp. Algorithmics, 2008

Hurdles Hardly Have to Be Heeded.
Proceedings of the Comparative Genomics, International Workshop, 2008

Phylogenetic Reconstruction from Complete Gene Orders of Whole Genomes.
Proceedings of the 6th Asia-Pacific Bioinformatics Conference, 2008

2005
A Framework for Orthology Assignment from Gene Rearrangement Data.
Proceedings of the Comparative Genomics, 2005

2004
Genomic Distances under Deletions and Insertions.
Theor. Comput. Sci., 2004


  Loading...