On Common Intervals with Errors
暂无分享,去创建一个
Jens Stoye | Cedric Chauve | Sven Rahmann | Yoan Diekmann | Steffen Heber | Julia Mixtacki | J. Stoye | S. Heber | Y. Diekmann | S. Rahmann | Julia Mixtacki | Cédric Chauve
[1] Jens Stoye,et al. Character sets of strings , 2007, J. Discrete Algorithms.
[2] M. Sagot,et al. Evolution under Reversals: Parsimony and Conservation of Common Intervals , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[3] David R. Wood,et al. On the Maximum Number of Cliques in a Graph , 2006, Graphs Comb..
[4] A. Litman,et al. On covering problems of codes , 1997, Theory of Computing Systems.
[5] Dirk Strothmann,et al. The Syntax and Semantics of a Language for Describing Complex Patterns in Biological Sequences , 2007 .
[6] Annie Chateau,et al. Inferring Positional Homologs with Common Intervals of Sequences , 2006, Comparative Genomics.
[7] Sven Rahmann,et al. Integer Linear Programs for Discovering Approximate Gene Clusters , 2006, WABI.
[8] Yu Zheng,et al. Phylogenetic detection of conserved gene clusters in microbial genomes , 2005, BMC Bioinformatics.
[9] Mathieu Raffinot,et al. Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs , 2005, SIAM J. Discret. Math..
[10] Dannie Durand,et al. The Incompatible Desiderata of Gene Cluster Properties , 2005, Comparative Genomics.
[11] Xin He,et al. Identifying Conserved Gene Clusters in the Presence of Homology Families , 2005, J. Comput. Biol..
[12] J. Risler,et al. Identification of genomic features using microsyntenies of domains: domain teams. , 2005, Genome research.
[13] Chinmay Karande,et al. Reporting maximal cliques: new insights into an old problem , 2005 .
[14] T. Schmidt. Efficient algorithms for gene cluster detection in prokaryotic genomes , 2005 .
[15] Kazuhisa Makino,et al. New Algorithms for Enumerating All Maximal Cliques , 2004, SWAT.
[16] Jens Stoye,et al. Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences , 2004, CPM.
[17] Giorgio Satta,et al. Efficient text fingerprinting via Parikh mapping , 2003, J. Discrete Algorithms.
[18] Gad M. Landau,et al. A Combinatorial Approach to Automatic Discovery of Cluster-Patterns , 2003, WABI.
[19] Gilles Didier,et al. Common Intervals of Two Sequences , 2003, WABI.
[20] Rolf Niedermeier,et al. Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems , 2003, Algorithmica.
[21] François Nicolas,et al. Complexities of the Centre and Median String Problems , 2003, CPM.
[22] Mathieu Raffinot,et al. Gene teams: a new formalization of gene clusters for comparative genomics , 2003, Comput. Biol. Chem..
[23] R. Niedermeier,et al. Exact Solutions for CLOSEST STRING and Related Problems , 2001, ISAAC.
[24] Jens Stoye,et al. Finding All Common Intervals of k Permutations , 2001, CPM.
[25] P Bork,et al. Gene context conservation of a higher order than operons. , 2000, Trends in biochemical sciences.
[26] Francisco Casacuberta,et al. Topology of Strings: Median String is NP-Complete , 1999, Theor. Comput. Sci..
[27] Takeaki Uno,et al. Fast Algorithms to Enumerate All Common Intervals of Two Permutations , 1997, Algorithmica.
[28] Bin Ma,et al. Distinguishing string selection problems , 2003, SODA '99.
[29] R. Overbeek,et al. The use of gene clusters to infer functional coupling. , 1999, Proceedings of the National Academy of Sciences of the United States of America.
[30] Andrzej Lingas,et al. Efficient approximation algorithms for the Hamming center problem , 1999, SODA '99.
[31] B. Snel,et al. Conservation of gene order: a fingerprint of proteins that physically interact. , 1998, Trends in biochemical sciences.
[32] J. Moon,et al. On cliques in graphs , 1965 .