Flexible pattern matching in strings : practical on-line search algorithms for texts and biological sequences / Gonzalo Navarro, Mathieu Raffinot.
Navarro, Gonzalo, 1969-| Call Number | 005.74 |
| Author | Navarro, Gonzalo, 1969- author. |
| Title | Flexible pattern matching in strings : practical on-line search algorithms for texts and biological sequences / Gonzalo Navarro, Mathieu Raffinot. |
| Physical Description | 1 online resource (x, 221 pages) : digital, PDF file(s). |
| Notes | Title from publisher's bibliographic system (viewed on 05 Oct 2015). |
| Summary | String matching problems range from the relatively simple task of searching a single text for a string of characters to searching a database for approximate occurrences of a complex pattern. Recent years have witnessed a dramatic increase of interest in sophisticated string matching problems, especially in information retrieval and computational biology. This book presents a practical approach to string matching problems, focusing on the algorithms and implementations that perform best in practice. It covers searching for simple, multiple and extended strings, as well as regular expressions, and exact and approximate searching. It includes all the most significant new developments in complex pattern searching. The clear explanations, step-by-step examples, algorithm pseudocode, and implementation efficiency maps will enable researchers, professionals and students in bioinformatics, computer science, and software engineering to choose the most appropriate algorithms for their applications. |
| Added Author | Raffinot, Mathieu, 1973- author. |
| Subject | COMPUTER ALGORITHMS. DATABASE SEARCHING. |
| Multimedia |
Total Ratings:
0
02358nam a22003738i 4500
001
vtls001585319
003
VRT
005
20200921122600.0
006
m|||||o||d||||||||
007
cr||||||||||||
008
200921s2002||||enk o ||1 0|eng|d
020
$a 9781316135228 (ebook)
020
$z 9780521813075 (hardback)
020
$z 9780521039932 (paperback)
035
$a (UkCbUP)CR9781316135228
039
9
$y 202009211226 $z santha
040
$a UkCbUP $b eng $e rda $c UkCbUP
050
0
0
$a QA76.9.A43 $b N38 2002
082
0
0
$a 005.74 $2 21
100
1
$a Navarro, Gonzalo, $d 1969- $e author.
245
1
0
$a Flexible pattern matching in strings : $b practical on-line search algorithms for texts and biological sequences / $c Gonzalo Navarro, Mathieu Raffinot.
264
1
$a Cambridge : $b Cambridge University Press, $c 2002.
300
$a 1 online resource (x, 221 pages) : $b digital, PDF file(s).
336
$a text $b txt $2 rdacontent
337
$a computer $b c $2 rdamedia
338
$a online resource $b cr $2 rdacarrier
500
$a Title from publisher's bibliographic system (viewed on 05 Oct 2015).
520
$a String matching problems range from the relatively simple task of searching a single text for a string of characters to searching a database for approximate occurrences of a complex pattern. Recent years have witnessed a dramatic increase of interest in sophisticated string matching problems, especially in information retrieval and computational biology. This book presents a practical approach to string matching problems, focusing on the algorithms and implementations that perform best in practice. It covers searching for simple, multiple and extended strings, as well as regular expressions, and exact and approximate searching. It includes all the most significant new developments in complex pattern searching. The clear explanations, step-by-step examples, algorithm pseudocode, and implementation efficiency maps will enable researchers, professionals and students in bioinformatics, computer science, and software engineering to choose the most appropriate algorithms for their applications.
650
0
$a COMPUTER ALGORITHMS.
650
0
$a DATABASE SEARCHING.
700
1
$a Raffinot, Mathieu, $d 1973- $e author.
776
0
8
$i Print version: $z 9780521813075
856
4
0
$u https://doi.org/10.1017/CBO9781316135228
999
$a VIRTUA
No Reviews to Display
| Summary | String matching problems range from the relatively simple task of searching a single text for a string of characters to searching a database for approximate occurrences of a complex pattern. Recent years have witnessed a dramatic increase of interest in sophisticated string matching problems, especially in information retrieval and computational biology. This book presents a practical approach to string matching problems, focusing on the algorithms and implementations that perform best in practice. It covers searching for simple, multiple and extended strings, as well as regular expressions, and exact and approximate searching. It includes all the most significant new developments in complex pattern searching. The clear explanations, step-by-step examples, algorithm pseudocode, and implementation efficiency maps will enable researchers, professionals and students in bioinformatics, computer science, and software engineering to choose the most appropriate algorithms for their applications. |
| Notes | Title from publisher's bibliographic system (viewed on 05 Oct 2015). |
| Subject | COMPUTER ALGORITHMS. DATABASE SEARCHING. |
| Multimedia |