A Faster Algorithm for Finding Minimum Tucker Submatrices

DOI10.1007/978-3-642-13962-8_8zbMath1286.68512OpenAlexW2163167830MaRDI QIDQ3576192

Stéphane Vialette, Romeo Rizzi, Guillaume Blin

Publication date: 29 July 2010

Published in: Programs, Proofs, Processes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13962-8_8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Genetics and epigenetics (92D10)

Related Items (5)

A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row ⋮ A faster algorithm for finding minimum Tucker submatrices ⋮ Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results ⋮ Consecutive Ones Property Testing: Cut or Swap ⋮ Structured preferences: a literature survey

This page was built for publication: A Faster Algorithm for Finding Minimum Tucker Submatrices