TY - GEN
T1 - Sequence covering arrays and linear extensions
AU - Murray, Patrick C.
AU - Colbourn, Charles
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2015.
PY - 2015
Y1 - 2015
N2 - Covering subsequences by sets of permutations arises in numerous applications. Given a set of permutations that cover a specific set of subsequences, it is of interest not just to know how few permutations can be used, but also to find a set of size equal to or close to the minimum. These permutation construction problems have proved to be computationally challenging; few explicit constructions have been found for small sets of permutations of intermediate length, mostly arising from greedy algorithms. A different strategy is developed here. Starting with a set that covers the specific subsequences required, we determine local changes that can be made in the permutations without losing the required coverage. By selecting these local changes (using linear extensions) so as to make one or more permutations less ‘important’ for coverage, the method attempts to make a permutation redundant so that it can be removed and the set size reduced. A post-optimization method to do this is developed, and preliminary results on sequence covering arrays show that it is surprisingly effective.
AB - Covering subsequences by sets of permutations arises in numerous applications. Given a set of permutations that cover a specific set of subsequences, it is of interest not just to know how few permutations can be used, but also to find a set of size equal to or close to the minimum. These permutation construction problems have proved to be computationally challenging; few explicit constructions have been found for small sets of permutations of intermediate length, mostly arising from greedy algorithms. A different strategy is developed here. Starting with a set that covers the specific subsequences required, we determine local changes that can be made in the permutations without losing the required coverage. By selecting these local changes (using linear extensions) so as to make one or more permutations less ‘important’ for coverage, the method attempts to make a permutation redundant so that it can be removed and the set size reduced. A post-optimization method to do this is developed, and preliminary results on sequence covering arrays show that it is surprisingly effective.
UR - http://www.scopus.com/inward/record.url?scp=84937469414&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84937469414&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-19315-1_24
DO - 10.1007/978-3-319-19315-1_24
M3 - Conference contribution
AN - SCOPUS:84937469414
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 274
EP - 285
BT - Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Revised Selected Papers
A2 - Froncek, Dalibor
A2 - Kratochvíl, Jan
A2 - Miller, Mirka
PB - Springer Verlag
T2 - 25th International Workshop on Combinatorial Algorithms, IWOCA 2014
Y2 - 15 October 2014 through 17 October 2014
ER -