Algorithms on strings / Maxime Crochemore, Christophe Hancart, Thierry Lecroq.
Crochemore, Maxime, 1947-| Call Number | 005.1 |
| Author | Crochemore, Maxime, 1947- author. |
| Title | Algorithms on strings / Maxime Crochemore, Christophe Hancart, Thierry Lecroq. |
| Physical Description | 1 online resource (viii, 383 pages) : digital, PDF file(s). |
| Notes | Title from publisher's bibliographic system (viewed on 05 Oct 2015). |
| Contents | Tools -- Pattern matching automata -- String searching with a sliding window -- Suffix arrays -- Structures for indexes -- Indexes -- Alignments -- Approximate patterns -- Local periods. |
| Summary | The book is intended for lectures on string processes and pattern matching in Master's courses of computer science and software engineering curricula. The details of algorithms are given with correctness proofs and complexity analysis, which make them ready to implement. Algorithms are described in a C-like language. The book is also a reference for students in computational linguistics or computational biology. It presents examples of questions related to the automatic processing of natural language, to the analysis of molecular sequences, and to the management of textual databases. |
| Added Author | Hancart, Christophe, 1964- author. Lecroq, Thierry, author. |
| Subject | COMPUTER ALGORITHMS. Matching theory. COMPUTATIONAL BIOLOGY. |
| Multimedia |
Total Ratings:
0
02164nam a22004098i 4500
001
vtls001584315
003
VRT
005
20200921121700.0
006
m|||||o||d||||||||
007
cr||||||||||||
008
200921s2007||||enk o ||1 0|eng|d
020
$a 9780511546853 (ebook)
020
$z 9780521848992 (hardback)
020
$z 9781107670990 (paperback)
035
$a (UkCbUP)CR9780511546853
039
9
$y 202009211217 $z santha
040
$a UkCbUP $b eng $e rda $c UkCbUP
050
0
0
$a QA76.9.A43 $b C757 2007
082
0
0
$a 005.1 $2 22
100
1
$a Crochemore, Maxime, $d 1947- $e author.
245
1
0
$a Algorithms on strings / $c Maxime Crochemore, Christophe Hancart, Thierry Lecroq.
264
1
$a Cambridge : $b Cambridge University Press, $c 2007.
300
$a 1 online resource (viii, 383 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).
505
0
$a Tools -- Pattern matching automata -- String searching with a sliding window -- Suffix arrays -- Structures for indexes -- Indexes -- Alignments -- Approximate patterns -- Local periods.
520
$a The book is intended for lectures on string processes and pattern matching in Master's courses of computer science and software engineering curricula. The details of algorithms are given with correctness proofs and complexity analysis, which make them ready to implement. Algorithms are described in a C-like language. The book is also a reference for students in computational linguistics or computational biology. It presents examples of questions related to the automatic processing of natural language, to the analysis of molecular sequences, and to the management of textual databases.
650
0
$a COMPUTER ALGORITHMS.
650
0
$a Matching theory.
650
0
$a COMPUTATIONAL BIOLOGY.
700
1
$a Hancart, Christophe, $d 1964- $e author.
700
1
$a Lecroq, Thierry, $e author.
776
0
8
$i Print version: $z 9780521848992
856
4
0
$u https://doi.org/10.1017/CBO9780511546853
999
$a VIRTUA
No Reviews to Display
| Summary | The book is intended for lectures on string processes and pattern matching in Master's courses of computer science and software engineering curricula. The details of algorithms are given with correctness proofs and complexity analysis, which make them ready to implement. Algorithms are described in a C-like language. The book is also a reference for students in computational linguistics or computational biology. It presents examples of questions related to the automatic processing of natural language, to the analysis of molecular sequences, and to the management of textual databases. |
| Notes | Title from publisher's bibliographic system (viewed on 05 Oct 2015). |
| Contents | Tools -- Pattern matching automata -- String searching with a sliding window -- Suffix arrays -- Structures for indexes -- Indexes -- Alignments -- Approximate patterns -- Local periods. |
| Subject | COMPUTER ALGORITHMS. Matching theory. COMPUTATIONAL BIOLOGY. |
| Multimedia |