String matching with involutions

DOI10.1007/978-3-642-32894-7_11MaRDI QIDQ4648193zbMATH OpenOpenAlexFDO

Authors Cristian Grozea, Florin Manea, Mike Müller, Dirk Nowotka

Publication date 8 November 2012

Published in Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32894-7_11

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• String matching with inversions and translocations in linear average time (most of the time)
• Text searching allowing for inversions and translocations of factors
• Efficient string-matching allowing for non-overlapping inversions
• Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time
• Publication:3468609

Cited in

(8)

• String matching with simple devices
• Efficient string-matching allowing for non-overlapping inversions
• Two-way string-matching
• scientific article; zbMATH DE number 1045407 (Why is no real title available?)
• String matching with lookahead
• Non-overlapping inversion on strings and languages
• Finding the Anticover of a String
• On string replacement exponentiation

This page was built for publication: String matching with involutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4648193)