Get started
Keyword

common intervals

Description: A combinatorial structure consisting of elements that occur consecutively in multiple permutations, studied in algorithms and computational biology.
OpenAlex ID: keywords/common-intervals
CREx: inferring genomic rearrangements based on common intervals
2007 · Matthias Bernt, Daniel Merkle, et al. · Bioinformatics · 393
PDF
Fast Algorithms to Enumerate All Common Intervals of Two Permutations
2000 · T. Uno, M. Yagiura · Algorithmica · 145
Finding All Common Intervals of k Permutations
2001 · Steffen Heber, Jens Stoye · Lecture notes in computer science · 98
On the Approximability of Comparing Genomes with Duplicates
2009 · Sébastien Angibaud, Guillaume Fertin, et al. · Journal of Graph Algorithms and Applications · 73
Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences
2004 · Thomas Schmidt, Jens Stoye · Lecture notes in computer science · 64
Perfect Sorting by Reversals Is Not Always Difficult
2007 · Severine Berard, Anne Bergeron, et al. · IEEE Transactions on Computational Biology and Bioinformatics · 59
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
2005 · Anne Bergeron, Cedric Chauve, et al. · Lecture notes in computer science · 47
Algorithms for Finding Gene Clusters
2001 · Steffen Heber, Jens Stoye · Lecture notes in computer science · 45
IEEE/ACM Transactions on Computational Biology and Bioinformatics
2008 · Anne Bergeron, Cedric Chauve, et al. · IEEE Engineering in Medicine and Biology Magazine · 43
Common intervals and sorting by reversals: a marriage of necessity
2002 · A. Bergeron, S. Heber, et al. · Bioinformatics · 41
Common Intervals of Two Sequences
2003 · Gilles Didier · Lecture notes in computer science · 38
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
2008 · Anne Bergeron, Cedric Chauve, et al. · SIAM Journal on Discrete Mathematics · 37
Comparing Genomes with Duplications: A Computational Complexity Point of View
2007 · G. Blin, C. Chauve, et al. · IEEE Transactions on Computational Biology and Bioinformatics · 37
Common Intervals and Symmetric Difference in a Model-Free Phylogenomics, with an Application to Streptophyte Evolution
2007 · Zaky Adam, Monique Turmel, et al. · Journal of Computational Biology · 35
Sorting by Reversals with Common Intervals
2004 · Martin Figeac, Jean-Stéphane Varré · Lecture notes in computer science · 32
Conservation of Combinatorial Structures in Evolution Scenarios
2005 · Sèverine Bérard, Anne Bergeron, et al. · Lecture notes in computer science · 28
Revisiting T. Uno and M. Yagiura’s Algorithm
2005 · Binh-Minh Bui Xuan, Michel Habib, et al. · Lecture notes in computer science · 26
Integer Linear Programs for Discovering Approximate Gene Clusters
2006 · Sven Rahmann, Gunnar W. Klau · Lecture notes in computer science · 25
Evolution under Reversals: Parsimony and Conservation of Common Intervals
2007 · Yoan Diekmann, Marie-France Sagot, et al. · IEEE Transactions on Computational Biology and Bioinformatics · 23
Factorization of synchronous context-free grammars in linear time
2007 · Hao Zhang, Daniel Gildea · 22
PDF
Genes Order and Phylogenetic Reconstruction: Application to γ-Proteobacteria
2005 · Guillaume Blin, Cedric Chauve, et al. · Lecture notes in computer science · 22
The Genetic Structures and Molecular Mechanisms Underlying Ear Traits in Maize (Zea mays L.)
2023 · Zhenying Dong, Yanbo Wang, et al. · Cells · 21
PDF
A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates
2007 · Sébastien Angibaud, Guillaume Fertin, et al. · Journal of Computational Biology · 20
PDF
Average-case Analysis of Perfect Sorting by Reversals
2011 · MATHILDE BOUVEL, CEDRIC CHAUVE, et al. · Discrete Mathematics Algorithms and Applications · 17
Genomes Containing Duplicates Are Hard to Compare
2006 · Cedric Chauve, Guillaume Fertin, et al. · Lecture notes in computer science · 17
Works count: 103
Citation count: 1,557
Year
Topic
Type