Search research articles
Contact Us
Filters
Showing results (1-10 of 27) with videos related to
Page
of 3
Sort By:
Bioinformatics (Oxford, England)
|
September 13, 2019
Large-scale mammalian genome rearrangements coincide with chromatin interactions
Krister M Swenson, Mathieu Blanchette
Algorithms for Molecular Biology : AMB
|
May 15, 2018
Finding local genome rearrangements
Pijus Simonaitis, Krister M Swenson
BMC Bioinformatics
|
January 4, 2013
Gene trees and species trees: irreconcilable differences
Krister M Swenson, Nadia El-Mabrouk
BMC Bioinformatics
|
January 4, 2013
A graph-theoretic approach for inparalog detection
Olivier Tremblay-Savard, Krister M Swenson
IEEE/ACM Transactions on Computational Biology and Bioinformatics
|
June 21, 2019
A Faster Algorithm for Computing the Kernel of Maximum Agreement Subtrees
Biing-Feng Wang, Krister M Swenson
Algorithms for Molecular Biology : AMB
|
May 19, 2016
Models and algorithms for genome rearrangement with positional constraints
Krister M Swenson, Pijus Simonaitis, Mathieu Blanchette
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
September 9, 2011
A 2-approximation for the minimum duplication speciation problem
Aïda Ouangraoua, Krister M Swenson, Cedric Chauve
BMC Bioinformatics
|
February 12, 2009
Inversion-based genomic signatures
Krister M Swenson, Bernard M E Moret
Algorithms for Molecular Biology : AMB
|
July 31, 2019
A general framework for genome rearrangement with biological constraints
Pijus Simonaitis, Annie Chateau, Krister M Swenson
Algorithms for Molecular Biology : AMB
|
April 21, 2011
Listing all sorting reversals in quadratic time
Krister M Swenson, Ghada Badr, David Sankoff
Page
of 3
Search research articles
Search
Showing results (1-10 of 27) with videos related to
Sort By:
Page
of 3
Bioinformatics (Oxford, England)
|
September 13, 2019
Large-scale mammalian genome rearrangements coincide with chromatin interactions
Krister M Swenson, Mathieu Blanchette
Algorithms for Molecular Biology : AMB
|
May 15, 2018
Finding local genome rearrangements
Pijus Simonaitis, Krister M Swenson
BMC Bioinformatics
|
January 4, 2013
Gene trees and species trees: irreconcilable differences
Krister M Swenson, Nadia El-Mabrouk
BMC Bioinformatics
|
January 4, 2013
A graph-theoretic approach for inparalog detection
Olivier Tremblay-Savard, Krister M Swenson
IEEE/ACM Transactions on Computational Biology and Bioinformatics
|
June 21, 2019
A Faster Algorithm for Computing the Kernel of Maximum Agreement Subtrees
Biing-Feng Wang, Krister M Swenson
Algorithms for Molecular Biology : AMB
|
May 19, 2016
Models and algorithms for genome rearrangement with positional constraints
Krister M Swenson, Pijus Simonaitis, Mathieu Blanchette
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
September 9, 2011
A 2-approximation for the minimum duplication speciation problem
Aïda Ouangraoua, Krister M Swenson, Cedric Chauve
BMC Bioinformatics
|
February 12, 2009
Inversion-based genomic signatures
Krister M Swenson, Bernard M E Moret
Algorithms for Molecular Biology : AMB
|
July 31, 2019
A general framework for genome rearrangement with biological constraints
Pijus Simonaitis, Annie Chateau, Krister M Swenson
Algorithms for Molecular Biology : AMB
|
April 21, 2011
Listing all sorting reversals in quadratic time
Krister M Swenson, Ghada Badr, David Sankoff
Page
of 3