|
|
|
Krister Swenson
|
|
|
|
MAIN PUBLICATIONS
|
Sorting signed permutations by inversions in O(n log n) time, Swenson, K.M., Rajan, V., Lin, Y., and Moret, B.M.E., To appear at RECOMB'09
``The Metropolized Partial Importance Sampling MCMC mixes slowly on minimal reversal rearrangement paths,", Miklos I., Melykuti B., and Swenson K.M.,, IEEE/ACM Trans. on Computational Biology and Bioinformatics, accepted, to appear (2009)
Maximum independent sets of commuting and
noninterfering inversions, Swenson K.M, Dong Y., Tang J., and Moret B.M.E., BMC Bioinformatics 2009, 10(Suppl 1):S6 (30 January 2009)
Inversion-based genomic signatures, Swenson K.M and Moret B.M.E., BMC Bioinformatics 2009, 10(Suppl 1):S7 (30 January 2009)
Hurdles hardly have to be heeded, Swenson K.M., Lin Y., Rajan V., and Moret B.M.E., Lecture Notes in Computer Science 5267, 241-251, Springer Verlag (2008).
Phylogenetic reconstruction from complete gene orders of whole genomes, Swenson K.M., Arndt W., Tang J., Moret B.M.E., Proceedings of 6th Asia-Pacific Bioinformatics Conference. Imperial College Press, London, January 2008.
A framework for orthology assignment from gene rearrangement data, Swenson, K.M., Pattengale, N.D., and Moret, B.M.E., Proc. 3rd RECOMB Workshop on Comparative Genomics RECOMBCG'05, Dublin (Ireland). Lecture Notes in Computer Science 3678, 153-166, Springer Verlag (2005)
Approximating the true evolutionary distance between two genomes, Swenson, K.M., Marron, M., Earnest-DeYoung, J.V., and Moret, B.M.E., ACM J. Experimental Algorithmics 12, 3.5 (2008)
Genomic distances under deletions and insertions, Marron, M., Swenson, K.M., and Moret, B.M.E., Theoretical Computer Science 325, 3 (2004), 347-360
|
|
Software
|
Download code related to my work here:
http://lcbb.epfl.ch/inversiontools-1.0.tgz
|
|
