A parameterized study of maximum generalized pattern matching problems (Q300450): Difference between revisions

Latest revision as of 06:31, 12 July 2024

scientific article; zbMATH DE number 6482364

A Parameterized Study of Maximum Generalized Pattern Matching Problems

Language	Label	Description	Also known as
English	A parameterized study of maximum generalized pattern matching problems	scientific article; zbMATH DE number 6482364	A Parameterized Study of Maximum Generalized Pattern Matching Problems

Statements

instance of

scholarly article

0 references

title

A parameterized study of maximum generalized pattern matching problems (English)

0 references

A Parameterized Study of Maximum Generalized Pattern Matching Problems (English)

0 references

0 references

0 references

0 references

Parameterized and Exact Computation

0 references

publication date

28 June 2016

0 references

15 September 2015

0 references

full work available at URL

https://arxiv.org/abs/1409.2398

0 references

http://eprints.whiterose.ac.uk/130765/1/main.pdf

0 references

zbMATH Keywords

generalized pattern matching

0 references

string morphisms

0 references

parameterized complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Generalized function matching

0 references

A note on the complexity of matching patterns with variables

0 references

Finding patterns common to a set of strings

0 references

Finite degrees of ambiguity in pattern languages

0 references

Patterns with bounded treewidth

0 references

Finding a homomorphism between two words is NP-complete

0 references

Pattern Matching with Variables: A Multivariate Complexity Analysis

0 references

Q2963897

0 references

Parametrized complexity theory.

0 references

UNAMBIGUOUS MORPHIC IMAGES OF STRINGS

0 references

Pattern languages with and without erasing

0 references

Developments from enquiries into the learnability of the pattern languages from positive data

0 references

On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems

0 references

A non-learnable class of E-pattern languages

0 references

Discontinuities in pattern inference

0 references

Q4749224

0 references

Identifiers

zbMATH Open document ID

1345.68179

0 references

1345.68178

0 references

DOI

10.1007/s00453-015-0008-8

0 references

10.1007/978-3-319-13524-3_23

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:300450

@@ Property / cites work @@
+Generalized function matching
@@ Property / cites work: Generalized function matching / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the complexity of matching patterns with variables
+Normal rank
@@ Property / cites work @@
+Finding patterns common to a set of strings
@@ Property / cites work: Finding patterns common to a set of strings / rank @@
+Normal rank
@@ Property / cites work @@
+Finite degrees of ambiguity in pattern languages
@@ Property / cites work: Finite degrees of ambiguity in pattern languages / rank @@
+Normal rank
@@ Property / cites work @@
+Patterns with bounded treewidth
@@ Property / cites work: Patterns with bounded treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a homomorphism between two words is NP-complete
+Normal rank
@@ Property / cites work @@
+Pattern Matching with Variables: A Multivariate Complexity Analysis
+Normal rank
@@ Property / cites work @@
+Q2963897
@@ Property / cites work: Q2963897 / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+UNAMBIGUOUS MORPHIC IMAGES OF STRINGS
@@ Property / cites work: UNAMBIGUOUS MORPHIC IMAGES OF STRINGS / rank @@
+Normal rank
@@ Property / cites work @@
+Pattern languages with and without erasing
@@ Property / cites work: Pattern languages with and without erasing / rank @@
+Normal rank
@@ Property / cites work @@
+Developments from enquiries into the learnability of the pattern languages from positive data
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
+Normal rank
@@ Property / cites work @@
+A non-learnable class of E-pattern languages
@@ Property / cites work: A non-learnable class of E-pattern languages / rank @@
+Normal rank
@@ Property / cites work @@
+Discontinuities in pattern inference
@@ Property / cites work: Discontinuities in pattern inference / rank @@
+Normal rank
@@ Property / cites work @@
+Q4749224
@@ Property / cites work: Q4749224 / rank @@
+Normal rank