Merging covering arrays and compressing multiple sequence alignments

Andreas H. Ronneseth, Charles Colbourn

Research output: Contribution to journalArticlepeer-review

24 Scopus citations


Covering arrays have been extensively studied, in part because of their applications in testing interacting software components. In this setting, fast and flexible methods are needed to construct covering arrays of close-to-minimum size. However testing scenarios often impose additional structure on the tests that can be selected. We extend a greedy method to construct test suites for complex systems that have a hierarchical structure in which components combine to form subsystems, which in turn form larger subsystems, until the entire system is formed. The algorithm for merging covering arrays that we propose is then shown to have further potential application in the compression of multiple sequence alignments of genomic data.

Original languageEnglish (US)
Pages (from-to)2177-2190
Number of pages14
JournalDiscrete Applied Mathematics
Issue number9
StatePublished - May 6 2009


  • Covering arrays
  • Mixed-level covering arrays
  • Multiple sequence alignment
  • Software interaction testing
  • t-way interaction coverage

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Merging covering arrays and compressing multiple sequence alignments'. Together they form a unique fingerprint.

Cite this