( en | de | ru )

 

Disambiguation of "Rizzi, Romeo"

Author of the publication

copydeleteadd this publication to your clipboard
Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG.

, , , , , , and . IEEE ACM Trans. Comput. Biol. Bioinform., 19 (6): 3673-3684 (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andreas Rizzi

Romeo Spemann

Otto Ritter Rizzi

Christiane Romeo

Romeo Spemann

 

Other publications of authors with the same name

Hybrid SAT-Based Consistency Checking Algorithms for Simple Temporal Networks with Decisions., , , and . TIME, volume 147 of LIPIcs, page 16:1-16:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)The Minimum Substring Cover Problem., , , and . WAOA, volume 4927 of Lecture Notes in Computer Science, page 170-183. Springer, (2007)Optimal Omnitig Listing for Safe and Complete Contig Assembly., , , , and . CPM, volume 78 of LIPIcs, page 29:1-29:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Evaluation of BIC-based algorithms for audio segmentation., , and . Comput. Speech Lang., 19 (2): 147-170 (2005)Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty., , and . TIME, volume 120 of LIPIcs, page 8:1-8:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Permutation Pattern matching in (213, 231)-avoiding permutations., , and . Discret. Math. Theor. Comput. Sci., (2016)When a dollar makes a BWT., , , and . Theor. Comput. Sci., (2021)Genome assembly, a universal theoretical framework: unifying and generalizing the safe and complete algorithms., , , , , and . CoRR, (2020)Cycle cover property and CPP=SCC property are not equivalent.. Discret. Math., 259 (1-3): 337-342 (2002)On the recognition of P4-indifferent graphs.. Discret. Math., 239 (1-3): 161-169 (2001)