Publications

Found 8 results
[ Author(Desc)] Title Type Year
Filters: Author is Jens Gramm  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
G
Gramm, J. (2004).  A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns. Proceedings of the Fourth International Workshop on Algorithms in Bioinformatics (WABI 2004).
Gramm, J., Ben-Dor A., & Sharan R. (2004).  Experimental Design for Multiplexed SNP Genotyping.
Gramm, J., Guo J., Hüffner F., & Niedermeier R. (2004).  Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. Theory of Computing Systems.
Gramm, J., Guo J., Hüffner F., & Niedermeier R. (2004).  Automated Generation of Search Tree Algorithms for Hard Graph-Modification Problems. Algorithmica. 39(4), 321-347.
Gramm, J., Guo J., & Niedermeier R. (2004).  Parameterized Intractability of Distinguishing Substring Selection. Theory of Computing Systems.
Gramm, J., Guo J., & Niedermeier R. (2004).  Pattern Matching for Arc-Annotated Sequences. Journal of Algorithms.
Gramm, J., Nierhoff T., Sharan R., & Tantau T. (2004).  On the Complexity of Haplotyping via Perfect Phylogeny. Proceedings of the Second RECOMB Satellite Workshop on Computational Methods for SNPs and Haplotypes. 35-46.
Gramm, J., Nierhoff T., & Tantau T. (2004).  Perfect Path Phylogeny Haplotyping with Missing Data is Fixed-Parameter Tractable. Proceedings of the First International Workshop on Parameterized and Exact Computation (IWPEC 2004).