Showing results (1-10 of 11) with videos related to

Sort By:
Pageof 2
Bioinformatics (Oxford, England)|October 19, 2002
Breakpoint medians and breakpoint phylogenies: a fixed-parameter approachJens Gramm, Rolf Niedermeier
IEEE/ACM Transactions on Computational Biology and Bioinformatics|October 21, 2006
A polynomial-time algorithm for the matching of crossing contact-map patternsJens Gramm
Methods in Molecular Biology (Clifton, N.J.)|August 21, 2008
Developing fixed-parameter algorithms to solve combinatorially explosive biological problemsFalk Hüffner, Rolf Niedermeier, Sebastian Wernicke
Methods in Molecular Biology (Clifton, N.J.)|June 21, 2008
Fixed-parameter algorithms in phylogeneticsJens Gramm, Arfst Nickelsen, Till Tantau
Methods in Molecular Biology (Clifton, N.J.)|November 30, 2016
Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological ProblemsFalk Hüffner, Christian Komusiewicz, Rolf Niedermeier, et al.
IEEE/ACM Transactions on Computational Biology and Bioinformatics|September 11, 2015
Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge CoverageFalk Hüffner, Christian Komusiewicz, Adrian Liebtrau, et al.
Autonomous Agents and Multi-Agent Systems|October 2, 2020
Stable roommates with narcissistic, single-peaked, and single-crossing preferencesRobert Bredereck, Jiehua Chen, Ugo Paavo Finnendahl, et al.
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology|June 15, 2005
Multiplexing schemes for generic SNP genotyping assaysRoded Sharan, Jens Gramm, Zohar Yakhini, et al.
Algorithms for Molecular Biology : AMB|August 27, 2011
Exploiting bounded signal flow for graph orientation based on cause-effect pairsBritta Dorn, Falk Hüffner, Dominikus Krüger, et al.
IEEE/ACM Transactions on Computational Biology and Bioinformatics|February 2, 2011
Parameterized algorithmics for finding connected motifs in biological networksNadja Betzler, René van Bevern, Michael R Fellows, et al.
Pageof 2