An Introduction To String Algorithms

An Introduction To String Algorithms

Out of Stock
SKU: DADAX0691274533
UPC: 9780691274539
Brand: Princeton University Press
Regular price$108.29
Sold out
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 1–3 business days
  • Estimated Delivery: 3–5 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
  • Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund

Returns accepted within 30 days of delivery.

Damaged or Defective Item

Free return shipping + replacement or full refund

Wrong Item Received

Free return shipping + replacement or full refund

Change of Mind

Return shipping at customer's expense · 25% restocking fee applies

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

An Essential Introduction To The Building Blocks Of Modern Text Processingstring Algorithms Make It Possible To Process, Store, And Manipulate Text With Computational Efficiency, With Applications Ranging From Search Engines And Social Networks That Regularly Process Terabytes Of Information To Areas Like Genomics, Where The Genome Of An Organism Can Be Encoded As A Long String Of Letters. This Book Provides An Incisive Introduction To The Concepts And Applications That Every Practitioner In The Field Needs To Know. Ideal For The Classroom And SelfStudy, It Guides Readers From The Fundamentals Of String Processing To Advanced Computational Methods, Presenting Useful Data Structures And Proof Techniques For Strings And Other Data And Serving As An OnRamp To Doing CuttingEdge Research In String Algorithms. Discusses Topics Ranging From Exact String Matching And Efficient Edit Distance Computation To Modern String Data Structures, Sketching Methods, And Generative Models Of Strings Covers Data Structures Such As Suffix Trees, Suffix Arrays, Wavelet Trees, The BurrowsWheeler Transform, The Fm Index, And Compressed Bit Vectors Presents An Array Of Algorithms Along With Their Proofs Of Correctness And Running Time Develops The Skills Needed To Design And Implement New String Algorithms As Well As Various Algorithmic Techniques That Are Applicable Beyond String Algorithms Invaluable For Anyone Interested In Processing Large Collections Of String Data, Including Genomic Sequences And Text For Training Large Language Models Includes Hundreds Of Exercises And Explanatory Figures An Indispensable Resource For Graduate Students, Advanced Undergraduates, Researchers, And Practitioners

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed