A fast algorithm for the string editing problem and decision graph complexity
Thesis. 1976. M.S.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Main Author: | Masek, William Joseph |
---|---|
Other Authors: | Ronald L. Rivest. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2008
|
Subjects: | |
Online Access: | http://dspace.mit.edu/handle/1721.1/26753 http://hdl.handle.net/1721.1/26753 |
Similar Items
-
A Faster Algorithm Computing String Edit Distances
by: Masek, William J., et al.
Published: (2023) -
Analysis of string matching compression algorithms
by: Nadarajan, Krishnaveny, et al.
Published: (2008) -
Tolerable Constructive Graph-Based Hyper-Heuristic Algorithm For Examination Timetabling
by: Mohammad Pour, Shahrzad
Published: (2009) -
Algorithms for string and graph layout
by: Newman, Alantha.
Published: (2005) -
Spatial hardware implementation for sparse graph algorithms in GraphStep
by: Delorimier, Michael, et al.
Published: (2015)