Long paths make pattern-counting hard, and deep trees make it harder
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10436740" target="_blank" >RIV/00216208:11320/21:10436740 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.4230/LIPIcs.IPEC.2021.22" target="_blank" >https://doi.org/10.4230/LIPIcs.IPEC.2021.22</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4230/LIPIcs.IPEC.2021.22" target="_blank" >10.4230/LIPIcs.IPEC.2021.22</a>
Alternative languages
Result language
angličtina
Original language name
Long paths make pattern-counting hard, and deep trees make it harder
Original language description
We study the counting problem known as #PPM, whose input is a pair of permutations π and τ (called pattern and text, respectively), and the task is to find the number of subsequences of τ that have the same relative order as π.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
16th International Symposium on Parameterized and Exact Computation (IPEC 2021)
ISBN
978-3-95977-216-7
ISSN
1868-8969
e-ISSN
—
Number of pages
17
Pages from-to
—
Publisher name
Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
Place of publication
Dagstuhl
Event location
online
Event date
Sep 8, 2021
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—