String editing on a one-way linear array of finite-state machines
- 1 January 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 41 (1), 112-118
- https://doi.org/10.1109/12.123389
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Parallel Parsing on a One-Way Array of Finite-State MachinesIEEE Transactions on Computers, 1987
- Designing Systolic Algorithms Using Sequential MachinesIEEE Transactions on Computers, 1986
- Some results concerning linear iterative (systolic) arraysJournal of Parallel and Distributed Computing, 1985
- Finding approximate patterns in stringsJournal of Algorithms, 1985
- Characterizations and computational complexity of systolic trellis automataTheoretical Computer Science, 1984
- Systolic trellis automatat†International Journal of Computer Mathematics, 1984
- The theory and computation of evolutionary distances: Pattern recognitionJournal of Algorithms, 1980
- A faster algorithm computing string edit distancesJournal of Computer and System Sciences, 1980
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975
- The String-to-String Correction ProblemJournal of the ACM, 1974