Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Swenson, Krister M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Listing all parsimonious reversal sequences: New algorithms and perspectives
Ghada Badr
,
Krister M. Swenson
,
David Sankoff
LNCS/LNBI
6398
, 2010, pp. 39-49
Ultra-perfect sorting scenarios
Aïda Ouangraoua
,
Anne Bergeron
,
Krister M. Swenson
LNCS/LNBI
6398
, 2010, pp. 50-61
An approximation algorithm for computing a parsimonious first speciation in the gene duplication model
Aïda Ouangraoua
,
Krister M. Swenson
,
Cedric Chauve
LNCS/LNBI
6398
, 2010, pp. 290-301
Sorting signed permutations by inversions in
O(n\log n)
time
Krister M. Swenson
,
Vaibhav Rajan
,
Yu Lin
,
Bernard M.E. Moret
LNCS/LNBI
5541
, 2009, pp. 386-399
Hurdles hardly have to be heeded
Krister M. Swenson
,
Yu Lin
,
Vaibhav Rajan
,
Bernard M.E. Moret
LNCS/LNBI
5267
, 2008, pp. 241-251
A framework for orthology assignment from gene rearrangement data
Krister M. Swenson
,
Nicholas D. Pattengale
,
B.M.E. Moret
LNCS/LNBI
3678
, 2005, pp. 153-166
Genomic distances under deletions and insertions
Mark Marron
,
Krister M. Swenson
,
Bernard M.E. Moret
Theoretical Computer Science
325
(3), 2004, pp. 347-360
Genomic distances under deletions and insertions
Mark Marron
,
Krister M. Swenson
,
Bernard M.E. Moret
Lecture Notes in Computer Science
2697
, 2003, pp. 537-547