Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails

von Equi, Massimo
Veröffentlicht in SOFSEM (47. : 2021 : Online) SOFSEM 2021: theory and practice of computer science (2021)

Genome-scale algorithm design : biological sequence analysis in the era of high-throughput sequencing

von Mäkinen, Veli
Veröffentlicht 2015

Safety and Completeness in Flow Decompositions for RNA Assembly

von Khan, Shahbaz
Veröffentlicht in RECOMB (26. : 2022 : La Jolla, Calif.) Research in computational molecular biology (2022)

A Linear-Time Parameterized Algorithm for Computing the Width ofa DAG

von Caceres, Manuel
Veröffentlicht in WG (47. : 2021 : Online) Graph-Theoretic Concepts in Computer Science (2021)

Fast, Flexible, and Exact Minimum Flow Decompositions via ILP

von Dias, Fernando H. C.
Veröffentlicht in RECOMB (26. : 2022 : La Jolla, Calif.) Research in computational molecular biology (2022)