Binary jumbled pattern matching on trees and tree-like structures

DOI10.1007/978-3-642-40450-4_44zbMATH Open1323.68634DBLPconf/esa/GagieHLW13OpenAlexW2172741897WikidataQ56813216 ScholiaQ56813216MaRDI QIDQ2849342FDOQ2849342

Authors: Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann 

Publication date: 17 September 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40450-4_44

Recommendations

• Binary jumbled pattern matching on trees and tree-like structures
• Binary jumbled string matching for highly run-length compressible texts
• New algorithms for binary jumbled pattern matching
• Algorithms for jumbled pattern matching in strings
• An efficient algorithm for some tree matching problems

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited In (9)

• Jump interpolation search trees and symmetric binary numbers
• Reconstruction of trees from jumbled and weighted subtrees
• On prefix normal words and prefix normal forms
• \(k\)-abelian pattern matching
• Segmenting Strings Homogeneously Via Trees
• Binary jumbled pattern matching on trees and tree-like structures
• Efficient preprocessing of simple binary pattern forests
• Engineering motif search for large motifs
• Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings

This page was built for publication: Binary jumbled pattern matching on trees and tree-like structures

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