Motif patterns in 2D
From MaRDI portal
Publication:2474071
DOI10.1016/j.tcs.2007.10.019zbMath1134.68068OpenAlexW1994649598MaRDI QIDQ2474071
Alberto Apostolico, Simona E. Rombo, Laxmi Parida
Publication date: 5 March 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.10.019
Related Items (3)
Irredundant tandem motifs ⋮ Extracting string motif bases for quorum higher than two ⋮ Optimal extraction of motif patterns in 2D
Cites Work
- Unnamed Item
- Unnamed Item
- The smallest automaton recognizing the subwords of a text
- Two-dimensional dictionary matching
- Two-dimensional pattern matching with rotations
- Optimal discovery of repetitions in 2D
- Verifying candidate matches in sparse and wildcard matching
- A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
- Three-Dimensional Periodicity and Its Application to Pattern Matching
- Combinatorial Pattern Matching
- Computing and Combinatorics
This page was built for publication: Motif patterns in 2D