Algorithms on strings:
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 describe...
Gespeichert in:
Beteilige Person: | |
---|---|
Weitere beteiligte Personen: | , |
Format: | E-Book |
Sprache: | Englisch |
Veröffentlicht: |
Cambridge
Cambridge University Press
2007
|
Links: | https://doi.org/10.1017/CBO9780511546853 |
Zusammenfassung: | 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. |
Umfang: | 1 Online-Ressource (viii, 383 Seiten) |
ISBN: | 9780511546853 |
Internformat
MARC
LEADER | 00000nam a2200000 i 4500 | ||
---|---|---|---|
001 | ZDB-20-CTM-CR9780511546853 | ||
003 | UkCbUP | ||
005 | 20151005020623.0 | ||
006 | m|||||o||d|||||||| | ||
007 | cr|||||||||||| | ||
008 | 090508s2007||||enk o ||1 0|eng|d | ||
020 | |a 9780511546853 | ||
100 | 1 | |a Crochemore, Maxime |d 1947- | |
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-Ressource (viii, 383 Seiten) | ||
336 | |b txt | ||
337 | |b c | ||
338 | |b cr | ||
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. | ||
700 | 1 | |a Hancart, Christophe |d 1964- | |
700 | 1 | |a Lecroq, Thierry | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521848992 |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781107670990 |
966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/CBO9780511546853 |3 Volltext |
912 | |a ZDB-20-CTM | ||
912 | |a ZDB-20-CTM | ||
049 | |a DE-91 |
Datensatz im Suchindex
DE-BY-TUM_katkey | ZDB-20-CTM-CR9780511546853 |
---|---|
_version_ | 1825574053334745089 |
adam_text | |
any_adam_object | |
author | Crochemore, Maxime 1947- |
author2 | Hancart, Christophe 1964- Lecroq, Thierry |
author2_role | |
author2_variant | c h ch t l tl |
author_facet | Crochemore, Maxime 1947- Hancart, Christophe 1964- Lecroq, Thierry |
author_role | |
author_sort | Crochemore, Maxime 1947- |
author_variant | m c mc |
building | Verbundindex |
bvnumber | localTUM |
collection | ZDB-20-CTM |
format | eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01445nam a2200277 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9780511546853</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20151005020623.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">090508s2007||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511546853</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Crochemore, Maxime</subfield><subfield code="d">1947-</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms on strings</subfield><subfield code="c">Maxime Crochemore, Christophe Hancart, Thierry Lecroq</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (viii, 383 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hancart, Christophe</subfield><subfield code="d">1964-</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lecroq, Thierry</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780521848992</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781107670990</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/CBO9780511546853</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
id | ZDB-20-CTM-CR9780511546853 |
illustrated | Not Illustrated |
indexdate | 2025-03-03T11:58:07Z |
institution | BVB |
isbn | 9780511546853 |
language | English |
open_access_boolean | |
owner | DE-91 DE-BY-TUM |
owner_facet | DE-91 DE-BY-TUM |
physical | 1 Online-Ressource (viii, 383 Seiten) |
psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
publishDate | 2007 |
publishDateSearch | 2007 |
publishDateSort | 2007 |
publisher | Cambridge University Press |
record_format | marc |
spelling | Crochemore, Maxime 1947- Algorithms on strings Maxime Crochemore, Christophe Hancart, Thierry Lecroq Cambridge Cambridge University Press 2007 1 Online-Ressource (viii, 383 Seiten) txt c cr 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. Hancart, Christophe 1964- Lecroq, Thierry Erscheint auch als Druck-Ausgabe 9780521848992 Erscheint auch als Druck-Ausgabe 9781107670990 |
spellingShingle | Crochemore, Maxime 1947- Algorithms on strings |
title | Algorithms on strings |
title_auth | Algorithms on strings |
title_exact_search | Algorithms on strings |
title_full | Algorithms on strings Maxime Crochemore, Christophe Hancart, Thierry Lecroq |
title_fullStr | Algorithms on strings Maxime Crochemore, Christophe Hancart, Thierry Lecroq |
title_full_unstemmed | Algorithms on strings Maxime Crochemore, Christophe Hancart, Thierry Lecroq |
title_short | Algorithms on strings |
title_sort | algorithms on strings |
work_keys_str_mv | AT crochemoremaxime algorithmsonstrings AT hancartchristophe algorithmsonstrings AT lecroqthierry algorithmsonstrings |