✦ LIBER ✦

On two-dimensional pattern matching by optimal parallel algorithms

✍ Scribed by Maxime Crochemore; Wojciech Rytter

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 781 KB
Volume: 132
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00012-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multi-Dimensional Pattern Matching with

Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms

✍ Raffaele Giancarlo; Roberto Grossi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 434 KB

We introduce a new multidimensional pattern matching problem that is a Ž natural generalization of string matching, a well studied problem A. V. Aho, Ž . ''Handbook of Theoretical Computer Science'' J. van Leeuwen, Ed. , pp. 257᎐295, . Elsevier, Amsterdam, 1990 . The motivation for its algorithmic s

Optimization of two-dimensional NMR by m

Optimization of two-dimensional NMR by matched accumulation

✍ Anil Kumar; Stephen C Brown; Mary E Donlan; Beat U Meier; Peter W Jeffs 📂 Article 📅 1991 🏛 Elsevier Science ⚖ 512 KB

On two-dimensional pattern-matching lang

On two-dimensional pattern-matching languages and their decision problems

✍ Kenichi Morita; Kaoru Nakazono; Kazuhiro Sugata 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 678 KB

Observations on optimal parallelizations

Observations on optimal parallelizations of two-list algorithm

✍ Carlos Alberto Alonso Sanches; Nei Yoshihiro Soma; Horacio Hideki Yanasse 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 129 KB

Parallel algorithms for querying data on

Parallel algorithms for querying data on two-dimensional electrophoresis gels

✍ D.J. Potter 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 621 KB

This paper describes some parallel processing algorithms for the analysis of twodimensional electrophoresis images. One of the largest processor arrays in the world. CLIP4, at University College London, was used in the research. The paper concentrates on algorithms using CLIP4 for querying the data

On the Complexity of Pattern Matching fo

On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts

✍ Piotr Berman; Marek Karpinski; Lawrence L. Larmore; Wojciech Plandowski; Wojciec 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 293 KB

We consider the complexity of problems related to two-dimensional texts (2D-texts) described succinctly. In a succinct description, larger rectangular subtexts are defined in terms of smaller parts in a way similar to that