Tomáš Flouri

Available identifiers

zbMath Open flouri.tomasMaRDI QIDQ393114

List of research outcomes

Publication	Date of Publication	Type
An Efficient Approach to Merging Paired-End Reads and Incorporation of Uncertainties	2020-08-07	Paper
An optimal algorithm for computing all subtree repeats in trees	2017-01-13	Paper
Longest common substrings with \(k\) mismatches	2015-05-21	Paper
Global and local sequence alignment with a bounded number of gaps	2015-04-29	Paper
Tree template matching in unranked ordered trees	2014-08-13	Paper
An Optimal Algorithm for Computing All Subtree Repeats in Trees	2014-01-17	Paper
Enhanced string covering	2014-01-16	Paper
Tree template matching in ranked ordered trees by pushdown automata	2013-06-24	Paper
Computing all subtree repeats in ordered trees	2013-03-21	Paper
https://portal.mardi4nfdi.de/entity/Q3165666	2012-10-29	Paper
Tree Template Matching in Ranked Ordered Trees by Pushdown Automata	2011-07-29	Paper

Research outcomes over time

This page was built for person: Tomáš Flouri