Regular biosequence pattern matching with cellular automata
type: Item
instance of: scholarly article
title: Regular biosequence pattern matching with cellular automata
zbMATH Open document ID: 1033.68587
DOI: 10.1016/S0020-0255(02)00303-1
author: Kim Laurio
author: Fredrik Linåker
author: Ajit Narayanan
published in: Information Sciences
publication date: 2003-02-11T00:00:00Z
Mathematics Subject Classification ID: 68Q80
Mathematics Subject Classification ID: 68U99
zbMATH DE Number: 1866887
zbMATH Keywords: cellular automata
zbMATH Keywords: biosequence
zbMATH Keywords: pattern matching
zbMATH Keywords: regular expression
describes a project that uses: ParaMEME
MaRDI profile type: Publication
cites work: Q3944542
cites work: Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
cites work: Q4849531
cites work: Linear-Time Computation by Nondeterministic Multidimensional Iterative Arrays
cites work: Real-time language recognition by one-dimensional cellular automata
cites work: Parallel language recognition in constant time by cellular automata
cites work: Q4837658
full work available at URL: s0020-0255(02)00303-1
OpenAlex ID: W1999378875
description: scientific article; zbMATH DE number 1866887