The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
Minkowski Sum page ). Next: Set and String Problems Up: Computational Geometry Previous: Maintaining Line Arrangements Algorithms Mon Jun 2 23:33:50 EDT 1997 file:///E|/BOOK/BOOK5/NODE199.HTM (3 of 3) [19/1/2003 1:32:01]
Set and String Problems Next: Set Cover Up: A Catalog of Algorithmic Previous: Minkowski Sum Set and String Problems Sets and strings both represent collections of objects. The primary difference is whether order matters. Sets are collections of symbols whose order is assumed to carry no significance, while the arrangement of symbols is exactly what defines a string. The assumption of a canonical order makes it possible to solve string problems much more efficiently than set problems, through techniques such as dynamic programming and advanced data structures like suffix trees. The interest in and importance of string processing algorithms have been increasing, largely due to biological and text-processing applications. A product of this interest are three recent books on string algorithms: ● Crochemore and Rytter [CR94] - A comprehensive book on advanced string algorithms, but somewhat formal and fairly difficult to follow. ● Stephen [Ste94] - A reasonably gentle introduction to basic string algorithmics. Possibly the best available book for the beginner. ● Gusfield [Gus97] - This is now the most comprehesive introduction to string algorithms. It contains a thorough discussion on suffix trees, with new, clear formulations of classical exact string-matching algorithms. ● Set Cover ● Set Packing ● String Matching ● Approximate String Matching ● Text Compression ● Cryptography ● Finite State Machine Minimization ● Longest Common Substring file:///E|/BOOK/BOOK5/NODE200.HTM (1 of 2) [19/1/2003 1:32:02]
- Page 565 and 566: Triangulation Next: Voronoi Diagram
- Page 567 and 568: Triangulation GEOMPACK is a suite o
- Page 569 and 570: Voronoi Diagrams Next: Nearest Neig
- Page 571 and 572: Voronoi Diagrams McDonald's, the ti
- Page 573 and 574: Nearest Neighbor Search Next: Range
- Page 575 and 576: Nearest Neighbor Search Implementat
- Page 577 and 578: Range Search Next: Point Location U
- Page 579 and 580: Range Search subdivisions in C++. I
- Page 581 and 582: Point Location the n edges for inte
- Page 583 and 584: Point Location More recently, there
- Page 585 and 586: Intersection Detection ● Do you w
- Page 587 and 588: Intersection Detection Implementati
- Page 589 and 590: Bin Packing Next: Medial-Axis Trans
- Page 591 and 592: Bin Packing approach for general sh
- Page 593 and 594: Medial-Axis Transformation Next: Po
- Page 595 and 596: Medial-Axis Transformation Implemen
- Page 597 and 598: Polygon Partitioning number of piec
- Page 599 and 600: Simplifying Polygons Next: Shape Si
- Page 601 and 602: Simplifying Polygons vertices and o
- Page 603 and 604: Shape Similarity Next: Motion Plann
- Page 605 and 606: Shape Similarity or how close it is
- Page 607 and 608: Motion Planning There is a wide ran
- Page 609 and 610: Motion Planning often arise in the
- Page 611 and 612: Maintaining Line Arrangements Think
- Page 613 and 614: Maintaining Line Arrangements Next:
- Page 615: Minkowski Sum where x+y is the vect
- Page 619 and 620: Set Cover Next: Set Packing Up: Set
- Page 621 and 622: Set Cover Figure: Hitting set is du
- Page 623 and 624: Set Packing Next: String Matching U
- Page 625 and 626: Set Packing Notes: An excellent exp
- Page 627 and 628: String Matching shouldn't try. Furt
- Page 629 and 630: String Matching and texts, I recomm
- Page 631 and 632: Approximate String Matching This sa
- Page 633 and 634: Approximate String Matching http://
- Page 635 and 636: Text Compression Next: Cryptography
- Page 637 and 638: Text Compression code string. ASCII
- Page 639 and 640: Cryptography Next: Finite State Mac
- Page 641 and 642: Cryptography ● How can I validate
- Page 643 and 644: Cryptography MD5 [Riv92] is the sec
- Page 645 and 646: Finite State Machine Minimization F
- Page 647 and 648: Finite State Machine Minimization S
- Page 649 and 650: Longest Common Substring than edit
- Page 651 and 652: Longest Common Substring include [A
- Page 653 and 654: Shortest Common Superstring Finding
- Page 655 and 656: Software systems Next: LEDA Up: Alg
- Page 657 and 658: LEDA Next: Netlib Up: Software syst
- Page 659 and 660: Netlib Algorithms Mon Jun 2 23:33:5
- Page 661 and 662: The Stanford GraphBase Next: Combin
- Page 663 and 664: Algorithm Animations with XTango Ne
- Page 665 and 666: Programs from Books Next: Discrete
Set and String Problems<br />
Next: Set Cover Up: A Catalog of <strong>Algorithm</strong>ic Previous: Minkowski Sum<br />
Set and String Problems<br />
Sets and strings both represent collections of objects. <strong>The</strong> primary difference is whether order matters.<br />
Sets are collections of symbols whose order is assumed to carry no significance, while the arrangement<br />
of symbols is exactly what defines a string.<br />
<strong>The</strong> assumption of a canonical order makes it possible to solve string problems much more efficiently<br />
than set problems, through techniques such as dynamic programming and advanced data structures like<br />
suffix trees. <strong>The</strong> interest in and importance of string processing algorithms have been increasing, largely<br />
due to biological and text-processing applications. A product of this interest are three recent books on<br />
string algorithms:<br />
● Crochemore and Rytter [CR94] - A comprehensive book on advanced string algorithms, but<br />
somewhat formal and fairly difficult to follow.<br />
● Stephen [Ste94] - A reasonably gentle introduction to basic string algorithmics. Possibly the best<br />
available book for the beginner.<br />
● Gusfield [Gus97] - This is now the most comprehesive introduction to string algorithms. It<br />
contains a thorough discussion on suffix trees, with new, clear formulations of classical exact<br />
string-matching algorithms.<br />
● Set Cover<br />
● Set Packing<br />
● String Matching<br />
● Approximate String Matching<br />
● Text Compression<br />
● Cryptography<br />
● Finite State Machine Minimization<br />
● Longest Common Substring<br />
file:///E|/BOOK/BOOK5/NODE200.HTM (1 of 2) [19/1/2003 1:32:02]
Change language