Search results for "common intervals"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Yoan Diekmann, Marie-France Sagot, Eric Tannier	Evolution under Reversals: Parsimony and Conservation of Common Intervals.	IEEE/ACM Trans. Comput. Biology Bioinform.	2007	DBLP DOI BibTeX RDF	perfect sorting, Computational biology, genome rearrangements, sorting by reversals, common intervals, signed permutations
2	Sébastien Angibaud, Damien Eveillard, Guillaume Fertin, Irena Rusu	Comparing Bacterial Genomes by Searching Their Common Intervals.	BICoB	2009	DBLP DOI BibTeX RDF	circular genome, comparative genomic, common interval
2	Guillaume Blin, Jens Stoye	Finding Nested Common Intervals Efficiently.	RECOMB-CG	2009	DBLP DOI BibTeX RDF
2	Sébastien Angibaud, Guillaume Fertin, Irena Rusu	On the Approximability of Comparing Genomes with Duplicates.	WALCOM	2008	DBLP DOI BibTeX RDF	conserved intervals, genome rearrangement, duplicates, breakpoints, adjacencies, common intervals, APX-Hardness
2	Sèverine Bérard, Anne Bergeron, Cedric Chauve, Christophe Paul	Perfect Sorting by Reversals Is Not Always Difficult.	IEEE/ACM Trans. Comput. Biology Bioinform.	2007	DBLP DOI BibTeX RDF	Evolution scenarios, reversals, common intervals
2	Guillaume Blin, Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette	Comparing Genomes with Duplications: A Computational Complexity Point of View.	IEEE/ACM Trans. Comput. Biology Bioinform.	2007	DBLP DOI BibTeX RDF	maximum adjacency disruption number, summed adjacency disruption number, computational complexity, Comparative genomics, common intervals
2	Matthias Bernt, Daniel Merkle, Martin Middendorf	The Reversal Median Problem, Common Intervals, and Mitochondrial Gene Orders.	CompLife	2006	DBLP DOI BibTeX RDF
2	Guillaume Blin, Annie Chateau, Cedric Chauve, Yannick Gingras	Inferring Positional Homologs with Common Intervals of Sequences.	Comparative Genomics	2006	DBLP DOI BibTeX RDF
2	Zaky Adam, Monique Turmel, Claude Lemieux, David Sankoff	Common Intervals and Symmetric Difference in a Model-Free Phylogenomics, with an Application to Streptophyte Evolution.	Comparative Genomics	2006	DBLP DOI BibTeX RDF
2	Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette	How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation.	Comparative Genomics	2006	DBLP DOI BibTeX RDF	heuristic, genome rearrangement, duplication, common intervals, pseudo-boolean programming
2	Anne Bergeron, Cedric Chauve, Fabien de Montgolfier, Mathieu Raffinot	Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs.	ESA	2005	DBLP DOI BibTeX RDF
2	Gui Liang Feng, Yujiang Shan	A generic algorithm to find all common intervals of two permutations.	CSB Workshops	2005	DBLP DOI BibTeX RDF
2	Guillaume Blin, Cedric Chauve, Guillaume Fertin	Genes Order and Phylogenetic Reconstruction: Application to gamma-Proteobacteria.	Comparative Genomics	2005	DBLP DOI BibTeX RDF	conserved intervals, ?-Proteobacteria, gene families, breakpoints, common intervals, Phylogenetic reconstruction
2	Martin Figeac, Jean-Stéphane Varré	Sorting by Reversals with Common Intervals.	WABI	2004	DBLP DOI BibTeX RDF
2	Thomas Schmidt, Jens Stoye	Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences.	CPM	2004	DBLP DOI BibTeX RDF
2	Gilles Didier	Common Intervals of Two Sequences.	WABI	2003	DBLP DOI BibTeX RDF
2	Steffen Heber, Jens Stoye	Finding All Common Intervals of k Permutations.	CPM	2001	DBLP BibTeX RDF
1	Biing-Feng Wang	Output-Sensitive Algorithms for Finding the Nested Common Intervals of Two General Sequences.	IEEE/ACM Trans. Comput. Biology Bioinform.	2012	DBLP DOI BibTeX RDF
1	Katharina Jahn	Approximate common intervals based gene cluster models.		2011	RDF
1	Steffen Heber, Richard Mayr, Jens Stoye	Common Intervals of Multiple Permutations.	Algorithmica	2011	DBLP DOI BibTeX RDF
1	Annie Chateau, Pierre Riou, Eric Rivals	Approximate Common Intervals in Multiple Genome Comparison.	BIBM	2011	DBLP DOI BibTeX RDF
1	Mathilde Bouvel, Cedric Chauve, Marni Mishna, Dominique Rossin	Average-Case Analysis of Perfect Sorting by Reversals.	CPM	2009	DBLP DOI BibTeX RDF
1	Sébastien Angibaud, Guillaume Fertin, Annelyse Thévenin, Stéphane Vialette	Pseudo Boolean Programming for Partially Ordered Genomes.	RECOMB-CG	2009	DBLP DOI BibTeX RDF
1	Anne Bergeron, Cedric Chauve, Fabien de Montgolfier, Mathieu Raffinot	Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs.	SIAM J. Discrete Math.	2008	DBLP DOI BibTeX RDF
1	Marília D. V. Braga, Marie-France Sagot, Celine Scornavacca, Eric Tannier	Exploring the Solution Space of Sorting by Reversals, with Experiments and an Application to Evolution.	IEEE/ACM Trans. Comput. Biology Bioinform.	2008	DBLP DOI BibTeX RDF	perfect sorting, sex chromosomes, evolution, genome rearrangements, sorting by reversals, common intervals, signed permutations
1	Matthias Bernt, Daniel Merkle, Martin Middendorf	Solving the Preserving Reversal Median Problem.	IEEE/ACM Trans. Comput. Biology Bioinform.	2008	DBLP DOI BibTeX RDF	Biology and genetics, Permutations and combinations
1	Matthias Bernt, Daniel Merkle, Kai Ramsch, Guido Fritzsch, Marleen Perseke, Detlef Bernhard, Martin Schlegel, Peter F. Stadler, Martin Middendorf	CREx: inferring genomic rearrangements based on common intervals.	Bioinformatics	2007	DBLP DOI BibTeX RDF
1	Zaky Adam, Monique Turmel, Claude Lemieux, David Sankoff	Common Intervals and Symmetric Difference in a Model-Free Phylogenomics, with an Application to Streptophyte Evolution.	Journal of Computational Biology	2007	DBLP DOI BibTeX RDF
1	Matthias Bernt, Daniel Merkle, Martin Middendorf	A Fast and Exact Algorithm for the Perfect Reversal Median Problem.	ISBRA	2007	DBLP DOI BibTeX RDF
1	Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette	A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes.	RECOMB-CG	2007	DBLP DOI BibTeX RDF	breakpoint distance, heuristic, genome rearrangement, duplication, pseudo-boolean programming
1	Sylvie Corteel, Guy Louchard, Robin Pemantle	Common intervals in permutations.	Discrete Mathematics & Theoretical Computer Science	2006	DBLP BibTeX RDF
1	Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette	Genomes Containing Duplicates Are Hard to Compare.	International Conference on Computational Science	2006	DBLP DOI BibTeX RDF
1	Sven Rahmann, Gunnar W. Klau	Integer Linear Programs for Discovering Approximate Gene Clusters.	WABI	2006	DBLP DOI BibTeX RDF
1	Steffen Heber, Carla D. Savage	Common intervals of trees.	Inf. Process. Lett.	2005	DBLP DOI BibTeX RDF
1	Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul	Revisiting T. Uno and M. Yagiura's Algorithm .	ISAAC	2005	DBLP DOI BibTeX RDF
1	Sèverine Bérard, Anne Bergeron, Cedric Chauve, Christophe Paul	Perfect Sorting by Reversals Is Not Always Difficult.	WABI	2005	DBLP DOI BibTeX RDF
1	Ross M. McConnell, Fabien de Montgolfier	Algebraic Operations on PQ Trees and Modular Decomposition Trees.	WG	2005	DBLP DOI BibTeX RDF
1	Sèverine Bérard, Anne Bergeron, Cedric Chauve	Conservation of Combinatorial Structures in Evolution Scenarios.	Comparative Genomics	2004	DBLP DOI BibTeX RDF
1	Anne Bergeron, Steffen Heber, Jens Stoye	Common intervals and sorting by reversals: a marriage of necessity.	ECCB	2002	DBLP BibTeX RDF
1	Steffen Heber, Jens Stoye	Algorithms for Finding Gene Clusters.	WABI	2001	DBLP DOI BibTeX RDF
1	Takeaki Uno, Mutsunori Yagiura	Fast Algorithms to Enumerate All Common Intervals of Two Permutations.	Algorithmica	2000	DBLP DOI BibTeX RDF