Regular biosequence pattern matching with cellular automata
From MaRDI portal
Publication:1857024
DOI10.1016/S0020-0255(02)00303-1zbMath1033.68587OpenAlexW1999378875MaRDI QIDQ1857024
Kim Laurio, Fredrik Linåker, Ajit Narayanan
Publication date: 11 February 2003
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0255(02)00303-1
Related Items
Measuring component importance for network system using cellular automata ⋮ Fluctuation-driven computing on number-conserving cellular automata ⋮ Non-uniform cellular automata based associative memory: Evolutionary design and basins of attraction ⋮ Efficient processing of substring match queries with inverted variable-length gram indexes ⋮ Fuzzy reliability analysis using cellular automata for network systems ⋮ On behavior of two-dimensional cellular automata with an exceptional rule ⋮ DNA sequence reconstruction based on innovated hybridization technique of probabilistic cellular automata and particle swarm optimization
Uses Software
Cites Work
- Parallel language recognition in constant time by cellular automata
- Real-time language recognition by one-dimensional cellular automata
- Linear-Time Computation by Nondeterministic Multidimensional Iterative Arrays
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- Unnamed Item
- Unnamed Item
- Unnamed Item