×

Found 1,456 Documents (Results 1–100)

100
MathJax

The complexity of approximate pattern matching on de Bruijn graphs. (English) Zbl 07577825

Pe’er, Itsik (ed.), Research in computational molecular biology. 26th annual international conference, RECOMB 2022, San Diego, CA, USA, May 22–25, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13278, 263-278 (2022).
MSC:  92D20 92C15 68Q17
PDF BibTeX XML Cite
Full Text: DOI

Nonlinear pattern matching in rule-based modeling languages. (English) Zbl 1491.92067

Cinquemani, Eugenio (ed.) et al., Computational methods in systems biology. 19th international conference, CMSB 2021, Bordeaux, France, September 22–24, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12881, 198-214 (2021).
MSC:  92C42 92C40 92-08
PDF BibTeX XML Cite
Full Text: DOI

A set automaton to locate all pattern matches in a term. (English) Zbl 07500638

Cerone, Antonio (ed.) et al., Theoretical aspects of computing – ICTAC 2021. 18th international colloquium, virtual event, Nur-Sultan, Kazakhstan, September 8–10, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12819, 67-85 (2021).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

On the complexity of timed pattern matching. (English) Zbl 07497998

Dima, Catalin (ed.) et al., Formal modeling and analysis of timed systems. 19th international conference, FORMATS 2021, Paris, France, August 24–26, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12860, 15-31 (2021).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails. (English) Zbl 1490.68151

Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 608-622 (2021).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Pattern eliminating transformations. (English) Zbl 07496642

Fernández, Maribel (ed.), Logic-based program synthesis and transformation. 30th international symposium, LOPSTR 2020, Bologna, Italy, September 7–9, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12561, 74-92 (2021).
MSC:  68N30
PDF BibTeX XML Cite
Full Text: DOI Link

A complexity dichotomy for permutation pattern matching on grid classes. (English) Zbl 07559423

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 52, 18 p. (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Learning specifications for labelled patterns. (English) Zbl 07317091

Bertrand, Nathalie (ed.) et al., Formal modeling and analysis of timed systems. 18th international conference, FORMATS 2020, Vienna, Austria, September 1–3, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12288, 76-93 (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI HAL

Pure pattern calculus à la de Bruijn. (English) Zbl 07313967

Nalon, Cláudia (ed.) et al., Proceedings of the 15th international workshop on logical and semantic frameworks, with applications, LSFA 2020, virtual workshop, August 27–28, 2020. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 351, 95-113 (2020).
MSC:  03B70 68Q55 68T27
PDF BibTeX XML Cite
Full Text: DOI arXiv

Approximating text-to-pattern Hamming distances. (English) Zbl 07298277

Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM). 643-656 (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Fast multiple pattern Cartesian tree matching. (English) Zbl 07224277

Rahman, M. Sohel (ed.) et al., WALCOM: algorithms and computation. 14th international conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12049, 107-119 (2020).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Parallel duel-and-sweep algorithm for the order-preserving pattern matching. (English) Zbl 1440.68342

Chatzigeorgiou, Alexander (ed.) et al., SOFSEM 2020: theory and practice of computer science. 46th international conference on current trends in theory and practice of informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12011, 211-222 (2020).
MSC:  68W32 68W10
PDF BibTeX XML Cite
Full Text: DOI

RLE edit distance in near optimal time. (English) Zbl 07561710

Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 66, 13 p. (2019).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

On the complexity of string matching for graphs. (English) Zbl 07561548

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 55, 15 p. (2019).
MSC:  68Nxx 68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Even faster elastic-degenerate string matching via fast matrix multiplication. (English) Zbl 07561514

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 21, 15 p. (2019).
MSC:  68Nxx 68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Online algorithms for constructing linear-size suffix trie. (English) Zbl 07559198

Pisanti, Nadia (ed.) et al., 30th annual symposium on combinatorial pattern matching, CPM 2019, Pisa, Italy, June 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 128, Article 30, 19 p. (2019).
MSC:  68W32
PDF BibTeX XML Cite
Full Text: DOI

Quasi-linear-time algorithm for longest common circular factor. (English) Zbl 07559193

Pisanti, Nadia (ed.) et al., 30th annual symposium on combinatorial pattern matching, CPM 2019, Pisa, Italy, June 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 128, Article 25, 14 p. (2019).
MSC:  68W32
PDF BibTeX XML Cite
Full Text: DOI

Streaming dictionary matching with mismatches. (English) Zbl 07559189

Pisanti, Nadia (ed.) et al., 30th annual symposium on combinatorial pattern matching, CPM 2019, Pisa, Italy, June 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 128, Article 21, 15 p. (2019).
MSC:  68W32
PDF BibTeX XML Cite
Full Text: DOI

Cartesian tree matching and indexing. (English) Zbl 07559184

Pisanti, Nadia (ed.) et al., 30th annual symposium on combinatorial pattern matching, CPM 2019, Pisa, Italy, June 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 128, Article 16, 14 p. (2019).
MSC:  68W32
PDF BibTeX XML Cite
Full Text: DOI

Approximating approximate pattern matching. (English) Zbl 07559183

Pisanti, Nadia (ed.) et al., 30th annual symposium on combinatorial pattern matching, CPM 2019, Pisa, Italy, June 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 128, Article 15, 13 p. (2019).
MSC:  68W32
PDF BibTeX XML Cite
Full Text: DOI

Hamming distance completeness. (English) Zbl 07559182

Pisanti, Nadia (ed.) et al., 30th annual symposium on combinatorial pattern matching, CPM 2019, Pisa, Italy, June 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 128, Article 14, 17 p. (2019).
MSC:  68W32
PDF BibTeX XML Cite
Full Text: DOI

Compressed multiple pattern matching. (English) Zbl 07559181

Pisanti, Nadia (ed.) et al., 30th annual symposium on combinatorial pattern matching, CPM 2019, Pisa, Italy, June 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 128, Article 13, 14 p. (2019).
MSC:  68W32
PDF BibTeX XML Cite
Full Text: DOI

How to exploit periodicity (Invited Talk). (English) Zbl 07559169

Pisanti, Nadia (ed.) et al., 30th annual symposium on combinatorial pattern matching, CPM 2019, Pisa, Italy, June 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 128, Article 1, 1 p. (2019).
MSC:  68W32
PDF BibTeX XML Cite
Full Text: DOI

Testing local properties of arrays. (English) Zbl 07559054

Blum, Avrim (ed.), 10th innovations in theoretical computer science conference, ITCS 2019, January 10–12, 2019, San Diego, CA, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 124, Article 11, 20 p. (2019).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

The parameterized complexity of finding point sets with hereditary properties. (English) Zbl 07378597

Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 11, 14 p. (2019).
MSC:  68Q25 68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

State complexity of single-word pattern matching in regular languages. (English) Zbl 1434.68238

Hospodár, Michal (ed.) et al., Descriptional complexity of formal systems. 21st IFIP WG 1.02 international conference, DCFS 2019, Košice, Slovakia, July 17–19, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11612, 86-97 (2019).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

Two-dimensional pattern matching against basic picture languages. (English) Zbl 1434.68278

Hospodár, Michal (ed.) et al., Implementation and application of automata. 24th international conference, CIAA 2019, Košice, Slovakia, July 22–25, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11601, 209-221 (2019).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

From pattern invocation networks to rule preconditions. (English) Zbl 1429.68199

Guerra, Esther (ed.) et al., Graph transformation. 12th international conference, ICGT 2019, held as part of STAF 2019, Eindhoven, the Netherlands, July 15–16, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11629, 195-211 (2019).
MSC:  68R10 68Q42
PDF BibTeX XML Cite
Full Text: DOI

Local decodability of the Burrows-Wheeler transform. (English) Zbl 1433.68134

Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 744-755 (2019).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Poster abstract: Moore-machine filtering for timed and untimed pattern matching. (English) Zbl 07120169

Proceedings of the 22nd ACM international conference on hybrid systems: computation and control, HSCC 2019, Montreal, Quebec, Canada, April 16–18, 2019. New York, NY: Association for Computing Machinery (ACM). 272-273 (2019).
MSC:  68Q45 68Q60 93C30
PDF BibTeX XML Cite
Full Text: DOI

Applications of \(V\)-order: suffix arrays, the Burrows-Wheeler transform & the FM-index. (English) Zbl 07117336

Das, Gautam K. (ed.) et al., WALCOM: algorithms and computation. 13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11355, 329-338 (2019).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software