The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
1.7.3 String Matching 1.7.3 String Matching INPUT OUTPUT Input Description: A text string t of length n . A patterns string p of length m . Problem: Find the first (or all) instances of the pattern in the text. Implementations ● Fire-Engine and Spare-Parts String and Language Algorithms (C++) (rating 7) ● David Eppstein's Knuth-Morris-Pratt Algorithm and Minkowski sum code (C++) (rating 4) ● Handbook of Algorithms and Data Structures (Pascal) (rating 4) ● Algorithms in C++ -- Sedgewick (C++) (rating 4) ● Xtango and Polka Algorithm Animation Systems (C++) (rating 3) Related Problems file:///E|/WEBSITE/FILES2/STRIHING.HTM (1 of 2) [19/1/2003 1:37:33]
1.7.3 String Matching ● Approximate String Matching ● Finite State Machine Minimization ● Graph Isomorphism ● Suffix Trees and Arrays Go to the corresponding chapter in the book About the Book Send us Mail Go to Main Page This page last modified on Tue Jun 03, 1997 . file:///E|/WEBSITE/FILES2/STRIHING.HTM (2 of 2) [19/1/2003 1:37:33]
- Page 1207 and 1208: 1.2.8 Factoring and Primality Testi
- Page 1209 and 1210: 1.2.9 Arbitrary Precision Arithmeti
- Page 1211 and 1212: 1.2.10 Knapsack Problem ● Linear
- Page 1213 and 1214: 1.3.2 Searching ● Sorting Go to t
- Page 1215 and 1216: 1.3.4 Generating Permutations ● C
- Page 1217 and 1218: 1.3.5 Generating Subsets ● Genera
- Page 1219 and 1220: 1.3.6 Generating Partitions ● Gen
- Page 1221 and 1222: 1.3.8 Calendrical Calculations Go t
- Page 1223 and 1224: 1.3.9 Job Scheduling ● Feedback E
- Page 1225 and 1226: 1.4.2 Topological Sorting Related P
- Page 1227 and 1228: 1.4.8 Edge and Vertex Connectivity
- Page 1229 and 1230: 1.4.10 Drawing Graphs Nicely ● Pl
- Page 1231 and 1232: 1.4.11 Drawing Trees ● Planarity
- Page 1233 and 1234: 1.4.12 Planarity Detection and Embe
- Page 1235 and 1236: 1.5.2 Independent Set ● Vertex Co
- Page 1237 and 1238: 1.5.3 Vertex Cover ● Independent
- Page 1239 and 1240: 1.5.4 Traveling Salesman Problem
- Page 1241 and 1242: 1.5.6 Graph Partition ● Network F
- Page 1243 and 1244: 1.5.7 Vertex Coloring Related Probl
- Page 1245 and 1246: 1.5.11 Feedback Edge/Vertex Set Go
- Page 1247 and 1248: 1.6.1 Robust Geometric Primitives G
- Page 1249 and 1250: 1.6.6 Range Search ● Kd-Trees ●
- Page 1251 and 1252: 1.6.8 Intersection Detection ● Ro
- Page 1253 and 1254: 1.6.16 Minkowski Sum Go to the corr
- Page 1255 and 1256: 1.7.1 Set Cover ● Set Packing ●
- Page 1257: 1.7.2 Set Packing Go to the corresp
- Page 1261 and 1262: 1.7.4 Approximate String Matching
- Page 1263 and 1264: 1.7.5 Text Compression Go to the co
- Page 1265 and 1266: 1.7.6 Cryptography ● Text Compres
- Page 1267 and 1268: 1.7.7 Finite State Machine Minimiza
- Page 1269 and 1270: 1.7.8 Longest Common Substring ●
- Page 1271 and 1272: 1.7.9 Shortest Common Superstring G
- Page 1273 and 1274: Handbook of Algorithms and Data Str
- Page 1275 and 1276: Moret and Shapiro's Algorithms P to
- Page 1277 and 1278: Index B Up: Index - All Index: B ba
- Page 1279 and 1280: Index C Up: Index - All Index: C ch
- Page 1281 and 1282: Index E Up: Index - All Index: E ed
- Page 1283 and 1284: Index G Up: Index - All Index: G ga
- Page 1285 and 1286: Index I Up: Index - All Index: I in
- Page 1287 and 1288: Index L Up: Index - All Index: L li
- Page 1289 and 1290: Index N Up: Index - All Index: N ne
- Page 1291 and 1292: Index P Up: Index - All Index: P pa
- Page 1293 and 1294: Index R Up: Index - All Index: R RA
- Page 1295 and 1296: Index S successor supercomputer , s
- Page 1297 and 1298: Index U Up: Index - All Index: U un
- Page 1299 and 1300: Index W Up: Index - All Index: W wo
- Page 1301 and 1302: Index (complete) bin packing bipart
- Page 1303 and 1304: Index (complete) Fourier transform
- Page 1305 and 1306: Index (complete) parenthesization p
- Page 1307 and 1308: Index (complete) symmetry, exploiti
1.7.3 String Matching<br />
1.7.3 String Matching<br />
INPUT OUTPUT<br />
Input Description: A text string t of length n . A patterns string p of length m .<br />
Problem: Find the first (or all) instances of the pattern in the text.<br />
Implementations<br />
● Fire-Engine and Spare-Parts String and Language <strong>Algorithm</strong>s (C++) (rating 7)<br />
● David Eppstein's Knuth-Morris-Pratt <strong>Algorithm</strong> and Minkowski sum code (C++) (rating 4)<br />
● Handbook of <strong>Algorithm</strong>s and Data Structures (Pascal) (rating 4)<br />
● <strong>Algorithm</strong>s in C++ -- Sedgewick (C++) (rating 4)<br />
● Xtango and Polka <strong>Algorithm</strong> Animation Systems (C++) (rating 3)<br />
Related Problems<br />
file:///E|/WEBSITE/FILES2/STRIHING.HTM (1 of 2) [19/1/2003 1:37:33]
Change language