Regular biosequence pattern matching with cellular automata
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3761989 (Why is no real title available?)
- scientific article; zbMATH DE number 769370 (Why is no real title available?)
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- Linear-Time Computation by Nondeterministic Multidimensional Iterative Arrays
- Parallel language recognition in constant time by cellular automata
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- Real-time language recognition by one-dimensional cellular automata
Cited in
(8)- On behavior of two-dimensional cellular automata with an exceptional rule
- Fuzzy reliability analysis using cellular automata for network systems
- DNA sequence reconstruction based on innovated hybridization technique of probabilistic cellular automata and particle swarm optimization
- Measuring component importance for network system using cellular automata
- Fluctuation-driven computing on number-conserving cellular automata
- Bio-inspired pattern processing by cellular ANTomata
- Efficient processing of substring match queries with inverted variable-length gram indexes
- Non-uniform cellular automata based associative memory: Evolutionary design and basins of attraction
This page was built for publication: Regular biosequence pattern matching with cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1857024)