Tomáš Flouri

From MaRDI portal
Revision as of 12:40, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:393114

Available identifiers

zbMath Open flouri.tomasMaRDI QIDQ393114

List of research outcomes





PublicationDate of PublicationType
An Efficient Approach to Merging Paired-End Reads and Incorporation of Uncertainties2020-08-07Paper
An optimal algorithm for computing all subtree repeats in trees2017-01-13Paper
Longest common substrings with \(k\) mismatches2015-05-21Paper
Global and local sequence alignment with a bounded number of gaps2015-04-29Paper
Tree template matching in unranked ordered trees2014-08-13Paper
An Optimal Algorithm for Computing All Subtree Repeats in Trees2014-01-17Paper
Enhanced string covering2014-01-16Paper
Tree template matching in ranked ordered trees by pushdown automata2013-06-24Paper
Computing all subtree repeats in ordered trees2013-03-21Paper
https://portal.mardi4nfdi.de/entity/Q31656662012-10-29Paper
Tree Template Matching in Ranked Ordered Trees by Pushdown Automata2011-07-29Paper

Research outcomes over time

This page was built for person: Tomáš Flouri

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:393114&oldid=7871894"
Powered by MediaWiki