#7,423 in Computers & technology books
Use arrows to jump to the previous/next product
Reddit mentions of Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences
Sentiment score: 0
Reddit mentions: 2
We found 2 Reddit mentions of Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences. Here are the top ones.
or
- Feeling is Believing - Get hugged to sleep all night every night. Enjoy the best sleep you deserve with this premium weighted blanket for adults & teens
- Deluxe Value Set - BOTH Luxury cover AND cotton weight blanket included. The cover is duvet style with a concealed zipper & incorporates corner ties to PREVENT CLUMPING. The inner weighted blanket is quilt style and Glass Beads are sewn into 6" POCKETS with double stitching. At (60x80 inches) this is suitable for an adult in a full or QUEEN size bed
- Relentlessly Researched & Engineered to be 7%-12% of your body weight or (7.5% of combined weight if SHARRING), this 25 lb adult weighted blanket is perfect for a 220-270 POUND person. By following the contours of your body the rocabi blanket provides sensory feedback, security and comfort
- Hug Simulator - Experience the GIFT of sleep with your own secure, soft, SLEEP COCOON. Embrace the soothing stimulus of additional weight with less heat in comparison to additional bed blankets, throws, comforters and other plush covers
- 365 Day Guaranteed Warranty*, Convenient & Practical - A REMOVABLE COVER makes maintenance a breeze. The cover is MACHINE WASHABLE and TUMBLE DRY ready.** Stay hygenic and increase the life of your blanket. rocabi promises 100% Customers Satisfaction, no hassle 30 day returns and a 365 DAY Craftsmanship Guarantee. If for any reason you're unhappy with your purchase, we offer a full refund - no questions asked!
Features:
Specs:
| Height | 10 Inches |
| Length | 7.25 Inches |
| Number of items | 1 |
| Weight | 1.22797479934 Pounds |
| Width | 0.75 Inches |
Bit-parallel text search algorithms like this are all covered in ridiculous detail in the book Flexible Pattern Matching In Strings by Gonzalo Navarro and Matthew Raffinot. (Also don't skip the errata here.) It's a good book (if you're willing to accept that it's biased propaganda for bitwise string searching while claiming to be an impartial recipe book for all string search algorithms) which even deals with fuzzy approximate text matching using these techniques.
What makes it so interesting is that this is the first time I've seen the full extent of bit twiddling hacks, developed in theoretical depth in "Hacker's Delight", really pushed extensively to solve a real problem. I mean, occasionally you would see Population Count or Clear Lowest Bit as an optimization trick in a chess program, but these guys use all of it as the basic technology for their field.
Sun Wu and Udi Manber were probably the first people to spot that, so long as the complete set of states fits inside a machine word, the CPU can be seen as simulating a Nondeterministic Finite Automaton very, very quickly. At that point, the race was on, and every new "bit hack" discovered extended the range of NFAs that could run inside a register. Combine that with code generation, as the article here does, and you've got something that runs like a bat out of hell. (But you'll notice the big problem is that it can tell you a regular expression match ends, but it can't tell you where it starts!)
Aye. And personally, I'm not a huge fan of using edit distance for fuzzy searches in most cases. I've found n-gram (with n=3 or n=4) to be much more effective. And you can use that in conjunction with bitap, for example, by using an n-gram index to narrow down your search space. I use an n-gram index in imdb-rename.
If you like algorithms like bitap, you'll definitely like Flexible Pattern Matching in Strings, which covers generalizations of bitaps for regexes themselves, for both Thompson and Glushkov automata.