| 2013 | ||
|---|---|---|
| j19 | Patrick Holloway, Krister M. Swenson, David H. Ardell, Nadia El-Mabrouk: Ancestral Genome Organization: An Alignment Approach. Journal of Computational Biology 20(4): 280-295 (2013) | |
| 2012 | ||
| j18 | Krister M. Swenson, Andrea Doroftei, Nadia El-Mabrouk: Gene tree correction for reconciliation and species tree inference. Algorithms for Molecular Biology 7: 31 (2012) | |
| j17 | Krister M. Swenson, Nadia El-Mabrouk: Gene trees and species trees: irreconcilable differences. BMC Bioinformatics 13(S-19): S15 (2012) | |
| j16 | Olivier Tremblay Savard, Krister M. Swenson: A graph-theoretic approach for inparalog detection. BMC Bioinformatics 13(S-19): S16 (2012) | |
| j15 | Krister M. Swenson, Eric Chen, Nicholas D. Pattengale, David Sankoff: The Kernel of Maximum Agreement Subtrees. IEEE/ACM Trans. Comput. Biology Bioinform. 9(4): 1023-1031 (2012) | |
| c16 | Aïda Ouangraoua, Krister M. Swenson, Anne Bergeron: On the Comparison of Sets of Alternative Transcripts. ISBRA 2012: 201-212 | |
| c15 | Patrick Holloway, Krister M. Swenson, David H. Ardell, Nadia El-Mabrouk: Evolution of Genome Organization by Duplication and Loss: An Alignment Approach. RECOMB 2012: 94-112 | |
| c14 | Manuel Lafond, Krister M. Swenson, Nadia El-Mabrouk: An Optimal Reconciliation Algorithm for Gene Trees with Polytomies. WABI 2012: 106-122 | |
| 2011 | ||
| j14 | Krister M. Swenson, Ghada Badr, David Sankoff: Listing all sorting reversals in quadratic time. Algorithms for Molecular Biology 6: 11 (2011) | |
| j13 | Aïda Ouangraoua, Krister M. Swenson, Cedric Chauve: A 2-Approximation for the Minimum Duplication Speciation Problem. Journal of Computational Biology 18(9): 1041-1053 (2011) | |
| j12 | Ghada Badr, Krister M. Swenson, David Sankoff: Listing All Parsimonious Reversal Sequences: New Algorithms and Perspectives. Journal of Computational Biology 18(9): 1201-1210 (2011) | |
| j11 | Aïda Ouangraoua, Anne Bergeron, Krister M. Swenson: Theory and Practice of Ultra-Perfection. Journal of Computational Biology 18(9): 1219-1230 (2011) | |
| j10 | Nicholas D. Pattengale, Andre J. Aberer, Krister M. Swenson, Alexandros Stamatakis, Bernard M. E. Moret: Uncovering Hidden Phylogenetic Consensus in Large Data Sets. IEEE/ACM Trans. Comput. Biology Bioinform. 8(4): 902-911 (2011) | |
| c13 | Krister M. Swenson, Eric Chen, Nicholas D. Pattengale, David Sankoff: The Kernel of Maximum Agreement Subtrees. ISBRA 2011: 123-135 | |
| c12 | Chunfang Zheng, Krister M. Swenson, Eric Lyons, David Sankoff: OMG! Orthologs in Multiple Genomes - Competing Graph-Theoretical Formulations. WABI 2011: 364-375 | |
| 2010 | ||
| j9 | Vaibhav Rajan, Andrew Wei Xu, Yu Lin, Krister M. Swenson, Bernard M. E. Moret: Heuristics for the inversion median problem. BMC Bioinformatics 11(S-1): 30 (2010) | |
| j8 | Yu Lin, Vaibhav Rajan, Krister M. Swenson, Bernard M. E. Moret: Estimating true evolutionary distances under rearrangements, duplications, and losses. BMC Bioinformatics 11(S-1): 54 (2010) | |
| j7 | Krister M. Swenson, Vaibhav Rajan, Yu Lin, Bernard M. E. Moret: Sorting Signed Permutations by Inversions in O(nlogn) Time. Journal of Computational Biology 17(3): 489-501 (2010) | |
| j6 | István Miklós, Bence Melykuti, Krister M. Swenson: The Metropolized Partial Importance Sampling MCMC Mixes Slowly on Minimum Reversal Rearrangement Paths. IEEE/ACM Trans. Comput. Biology Bioinform. 7(4): 763-767 (2010) | |
| c11 | Nicholas D. Pattengale, Krister M. Swenson, Bernard M. E. Moret: Uncovering Hidden Phylogenetic Consensus. ISBRA 2010: 128-139 | |
| c10 | Ghada Badr, Krister M. Swenson, David Sankoff: Listing All Parsimonious Reversal Sequences: New Algorithms and Perspectives. RECOMB-CG 2010: 39-49 | |
| c9 | Aïda Ouangraoua, Anne Bergeron, Krister M. Swenson: Ultra-Perfect Sorting Scenarios. RECOMB-CG 2010: 50-61 | |
| c8 | Aïda Ouangraoua, Krister M. Swenson, Cedric Chauve: An Approximation Algorithm for Computing a Parsimonious First Speciation in the Gene Duplication Model. RECOMB-CG 2010: 290-301 | |
| c7 | Krister M. Swenson, Ghada Badr, David Sankoff: Listing All Sorting Reversals in Quadratic Time. WABI 2010: 102-110 | |
| 2009 | ||
| j5 | Krister M. Swenson, Bernard M. E. Moret: Inversion-based genomic signatures. BMC Bioinformatics 10(S-1) (2009) | |
| j4 | Krister M. Swenson, Yokuki To, Jijun Tang, Bernard M. E. Moret: Maximum independent sets of commuting and noninterfering inversions. BMC Bioinformatics 10(S-1) (2009) | |
| j3 | Krister M. Swenson, Yu Lin, Vaibhav Rajan, Bernard M. E. Moret: Hurdles and Sorting by Inversions: Combinatorial, Statistical, and Experimental Results. Journal of Computational Biology 16(10): 1339-1351 (2009) | |
| c6 | Krister M. Swenson, Vaibhav Rajan, Yu Lin, Bernard M. E. Moret: Sorting Signed Permutations by Inversions in O(nlogn) Time. RECOMB 2009: 386-399 | |
| 2008 | ||
| j2 | Krister M. Swenson, Mark Marron, Joel V. Earnest-DeYoung, Bernard M. E. Moret: Approximating the true evolutionary distance between two genomes. ACM Journal of Experimental Algorithmics 12 (2008) | |
| c5 | Krister M. Swenson, William Arndt, Jijun Tang, Bernard M. E. Moret: Phylogenetic Reconstruction from Complete Gene Orders of Whole Genomes. APBC 2008: 241-250 | |
| c4 | Krister M. Swenson, Yu Lin, Vaibhav Rajan, Bernard M. E. Moret: Hurdles Hardly Have to Be Heeded. RECOMB-CG 2008: 241-251 | |
| 2005 | ||
| c3 | Krister M. Swenson, Mark Marron, Joel V. Earnest-DeYoung, Bernard M. E. Moret: Approximating the True Evolutionary Distance between Two Genomes. ALENEX/ANALCO 2005: 121-129 | |
| c2 | Krister M. Swenson, Nicholas D. Pattengale, Bernard M. E. Moret: A Framework for Orthology Assignment from Gene Rearrangement Data. Comparative Genomics 2005: 153-166 | |
| 2004 | ||
| j1 | Mark Marron, Krister M. Swenson, Bernard M. E. Moret: Genomic Distances under Deletions and Insertions. Theor. Comput. Sci. 325(3): 347-360 (2004) | |
| 2003 | ||
| c1 | Mark Marron, Krister M. Swenson, Bernard M. E. Moret: Genomic Distances under Deletions and Insertions. COCOON 2003: 537-547 | |
Colors in the list of coauthors
Last update Sun May 19 18:03:11 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page