Tomáš Flouri

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
An efficient approach to merging paired-end reads and incorporation of uncertainties Algorithms for Next-Generation Sequencing Data	2020-08-07	Paper
An optimal algorithm for computing all subtree repeats in trees Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences	2017-01-13	Paper
Longest common substrings with \(k\) mismatches Information Processing Letters	2015-05-21	Paper
Global and local sequence alignment with a bounded number of gaps Theoretical Computer Science	2015-04-29	Paper
Tree template matching in unranked ordered trees Journal of Discrete Algorithms	2014-08-13	Paper
An optimal algorithm for computing all subtree repeats in trees Lecture Notes in Computer Science	2014-01-17	Paper
Enhanced string covering Theoretical Computer Science	2014-01-16	Paper
Tree template matching in ranked ordered trees by pushdown automata Journal of Discrete Algorithms	2013-06-24	Paper
Computing all subtree repeats in ordered trees Information Processing Letters	2013-03-21	Paper
Arbology: trees and pushdown automata	2012-10-29	Paper
Tree template matching in ranked ordered trees by pushdown automata Implementation and Application of Automata	2011-07-29	Paper

Research outcomes over time

This page was built for person: Tomáš Flouri