Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
Work
Year: 2008
Type: article
Abstract: We introduce a new approach to compute the common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple and efficient ... more
Institutions Laboratoire d'Informatique Algorithmique: Fondements et Applications, Université Paris Cité
Cites: 5
Cited by: 38
Related to: 10
FWCI: 2.311
Citation percentile (by year/subfield): 77.1
Subfield: Genetics
Domain: Life Sciences
Open Access status: green