Verfügbarkeit: Pattern matching algorithms /

Pattern matching algorithms /:

This text provides an overview of the current state of pattern matching as seen by specialists who have devoted years of study to the field. It covers most of the basic principles and presents material from the frontier of research.

Gespeichert in:

Bibliographische Detailangaben
Weitere Verfasser:	Apostolico, Alberto, 1948-, Galil, Zvi
Format:	Elektronisch E-Book
Sprache:	English
Veröffentlicht:	New York : Oxford University Press, 1997.
Schlagworte:	Computer algorithms. Combinatorial analysis. Algorithms Algorithmes. Analyse combinatoire. algorithms. COMPUTERS > Optical Data Processing. Combinatorial analysis Computer algorithms Algorithmus Mustervergleich Mustererkennung Combinatória.
Online-Zugang:	Volltext
Zusammenfassung:	This text provides an overview of the current state of pattern matching as seen by specialists who have devoted years of study to the field. It covers most of the basic principles and presents material from the frontier of research.
Beschreibung:	1 online resource (377 pages :)
Bibliographie:	Includes bibliographical references and index.
ISBN:	1423759702 9781423759706 1602561915 9781602561915 1280453915 9781280453915 9786610453917 6610453918 0195354346 9780195354348

Internformat

MARC


LEADER	00000cam a2200000 a 4500
001	ZDB-4-EBA-ocn666957542
003	OCoLC
005	20240705115654.0
006	m o d
007	cr cn\|\|\|\|\|\|\|\|\|
008	100929s1997 nyua ob 001 0 eng d
040			\|a IDEBK \|b eng \|e pn \|c IDEBK \|d N$T \|d YDXCP \|d E7B \|d NRU \|d OCLCQ \|d DEBSZ \|d OCLCQ \|d OCLCF \|d OCLCQ \|d AGLDB \|d OCLCQ \|d VTS \|d REC \|d K6U \|d OCLCO \|d VLY \|d OCLCQ \|d OCLCO \|d SFB \|d OCLCO \|d OCLCQ \|d OCLCO \|d OCLCL
019			\|a 65171755 \|a 191038282 \|a 647837087 \|a 814452807 \|a 819509827 \|a 821689735 \|a 1162425092
020			\|a 1423759702 \|q (electronic bk.)
020			\|a 9781423759706 \|q (electronic bk.)
020			\|a 1602561915
020			\|a 9781602561915
020			\|a 1280453915
020			\|a 9781280453915
020			\|a 9786610453917
020			\|a 6610453918
020			\|a 0195354346
020			\|a 9780195354348
020			\|z 9780195113679
020			\|z 0195113675 \|q (acid-free paper)
035			\|a (OCoLC)666957542 \|z (OCoLC)65171755 \|z (OCoLC)191038282 \|z (OCoLC)647837087 \|z (OCoLC)814452807 \|z (OCoLC)819509827 \|z (OCoLC)821689735 \|z (OCoLC)1162425092
050		4	\|a QA76.9.A43 \|b P38 1997
072		7	\|a COM \|x 047000 \|2 bisacsh
072		7	\|a UAA \|2 bicssc
082	7		\|a 006.4 \|2 21
084			\|a ST 130 \|2 rvk
084			\|a ST 330 \|2 rvk
084			\|a DAT 776f \|2 stub
049			\|a MAIN
245	0	0	\|a Pattern matching algorithms / \|c edited by Alberto Apostolico, Zvi Galil.
260			\|a New York : \|b Oxford University Press, \|c 1997.
300			\|a 1 online resource (377 pages :)
336			\|a text \|b txt \|2 rdacontent
337			\|a computer \|b c \|2 rdamedia
338			\|a online resource \|b cr \|2 rdacarrier
504			\|a Includes bibliographical references and index.
505	0		\|a Off-line serial exact string searching / M. Crochemore -- Off-line parallel exact string searching / Z. Galil and I. Yudkiewicz -- On-line string searching / A. Apostolico -- Serial computations of Levenshtein distances / D.S. Hirschberg -- Parallel computations of Levenshtein distances / A. Apostolico and M.J. Atallah -- Approximate string searching / G.M. Landau and U. Vishkin -- Dynamic programming : special cases / R. Giancarlo -- Shortest common superstrings / M. Li and T. Jiang -- Two dimensional matching / A. Amir and M. Farach -- Suffix tree data structures for matrices / R. Giancarlo and R. Grossi -- Tree pattern matching / K. Zhang and D. Shasa.
520			\|a This text provides an overview of the current state of pattern matching as seen by specialists who have devoted years of study to the field. It covers most of the basic principles and presents material from the frontier of research.
546			\|a English.
650		0	\|a Computer algorithms. \|0 http://id.loc.gov/authorities/subjects/sh91000149
650		0	\|a Combinatorial analysis. \|0 http://id.loc.gov/authorities/subjects/sh85028802
650		2	\|a Algorithms \|0 https://id.nlm.nih.gov/mesh/D000465
650		6	\|a Algorithmes.
650		6	\|a Analyse combinatoire.
650		7	\|a algorithms. \|2 aat
650		7	\|a COMPUTERS \|x Optical Data Processing. \|2 bisacsh
650		7	\|a Combinatorial analysis \|2 fast
650		7	\|a Computer algorithms \|2 fast
650		7	\|a Algorithmus \|2 gnd \|0 http://d-nb.info/gnd/4001183-5
650		7	\|a Mustervergleich \|2 gnd \|0 http://d-nb.info/gnd/4307192-2
650		7	\|a Mustererkennung \|2 gnd \|0 http://d-nb.info/gnd/4040936-3
650		7	\|a Combinatória. \|2 larpcal
700	1		\|a Apostolico, Alberto, \|d 1948- \|0 http://id.loc.gov/authorities/names/n85091749
700	1		\|a Galil, Zvi.
758			\|i has work: \|a Pattern matching algorithms (Text) \|1 https://id.oclc.org/worldcat/entity/E39PCG3Rm8yghytb4tmJCTr6Xb \|4 https://id.oclc.org/worldcat/ontology/hasWork
776	0	8	\|i Print version: \|t Pattern matching algorithms. \|d New York : Oxford University Press, 1997 \|z 9780195113679 \|w (DLC) 96049602 \|w (OCoLC)35928466
856	1		\|l FWS01 \|p ZDB-4-EBA \|q FWS_PDA_EBA \|u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=151292 \|3 Volltext
856	1		\|l CBO01 \|p ZDB-4-EBA \|q FWS_PDA_EBA \|u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=151292 \|3 Volltext
938			\|a ebrary \|b EBRY \|n ebr10358422
938			\|a EBSCOhost \|b EBSC \|n 151292
938			\|a ProQuest MyiLibrary Digital eBook Collection \|b IDEB \|n 45391
938			\|a YBP Library Services \|b YANK \|n 2629251
938			\|a YBP Library Services \|b YANK \|n 3158746
938			\|a YBP Library Services \|b YANK \|n 2405256
994			\|a 92 \|b GEBAY
912			\|a ZDB-4-EBA

Datensatz im Suchindex

DE-BY-FWS_katkey	ZDB-4-EBA-ocn666957542
_version_	1813903383835181056
adam_text
any_adam_object
author2	Apostolico, Alberto, 1948- Galil, Zvi
author2_role
author2_variant	a a aa z g zg
author_GND	http://id.loc.gov/authorities/names/n85091749
author_facet	Apostolico, Alberto, 1948- Galil, Zvi
author_sort	Apostolico, Alberto, 1948-
building	Verbundindex
bvnumber	localFWS
callnumber-first	Q - Science
callnumber-label	QA76
callnumber-raw	QA76.9.A43 P38 1997
callnumber-search	QA76.9.A43 P38 1997
callnumber-sort	QA 276.9 A43 P38 41997
callnumber-subject	QA - Mathematics
classification_rvk	ST 130 ST 330
classification_tum	DAT 776f
collection	ZDB-4-EBA
contents	Off-line serial exact string searching / M. Crochemore -- Off-line parallel exact string searching / Z. Galil and I. Yudkiewicz -- On-line string searching / A. Apostolico -- Serial computations of Levenshtein distances / D.S. Hirschberg -- Parallel computations of Levenshtein distances / A. Apostolico and M.J. Atallah -- Approximate string searching / G.M. Landau and U. Vishkin -- Dynamic programming : special cases / R. Giancarlo -- Shortest common superstrings / M. Li and T. Jiang -- Two dimensional matching / A. Amir and M. Farach -- Suffix tree data structures for matrices / R. Giancarlo and R. Grossi -- Tree pattern matching / K. Zhang and D. Shasa.
ctrlnum	(OCoLC)666957542
dewey-full	006.4
dewey-hundreds	000 - Computer science, information, general works
dewey-ones	006 - Special computer methods
dewey-raw	006.4
dewey-search	006.4
dewey-sort	16.4
dewey-tens	000 - Computer science, information, general works
discipline	Informatik
format	Electronic eBook
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04229cam a2200793 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn666957542</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20240705115654.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cn\|\|\|\|\|\|\|\|\|</controlfield><controlfield tag="008">100929s1997 nyua ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">IDEBK</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">IDEBK</subfield><subfield code="d">N$T</subfield><subfield code="d">YDXCP</subfield><subfield code="d">E7B</subfield><subfield code="d">NRU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AGLDB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VTS</subfield><subfield code="d">REC</subfield><subfield code="d">K6U</subfield><subfield code="d">OCLCO</subfield><subfield code="d">VLY</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">SFB</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">65171755</subfield><subfield code="a">191038282</subfield><subfield code="a">647837087</subfield><subfield code="a">814452807</subfield><subfield code="a">819509827</subfield><subfield code="a">821689735</subfield><subfield code="a">1162425092</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1423759702</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781423759706</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1602561915</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781602561915</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1280453915</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781280453915</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9786610453917</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">6610453918</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0195354346</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780195354348</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780195113679</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0195113675</subfield><subfield code="q">(acid-free paper)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)666957542</subfield><subfield code="z">(OCoLC)65171755</subfield><subfield code="z">(OCoLC)191038282</subfield><subfield code="z">(OCoLC)647837087</subfield><subfield code="z">(OCoLC)814452807</subfield><subfield code="z">(OCoLC)819509827</subfield><subfield code="z">(OCoLC)821689735</subfield><subfield code="z">(OCoLC)1162425092</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA76.9.A43</subfield><subfield code="b">P38 1997</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">047000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">UAA</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">006.4</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 330</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 776f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="245" ind1="0" ind2="0"><subfield code="a">Pattern matching algorithms /</subfield><subfield code="c">edited by Alberto Apostolico, Zvi Galil.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">New York :</subfield><subfield code="b">Oxford University Press,</subfield><subfield code="c">1997.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (377 pages :)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Off-line serial exact string searching / M. Crochemore -- Off-line parallel exact string searching / Z. Galil and I. Yudkiewicz -- On-line string searching / A. Apostolico -- Serial computations of Levenshtein distances / D.S. Hirschberg -- Parallel computations of Levenshtein distances / A. Apostolico and M.J. Atallah -- Approximate string searching / G.M. Landau and U. Vishkin -- Dynamic programming : special cases / R. Giancarlo -- Shortest common superstrings / M. Li and T. Jiang -- Two dimensional matching / A. Amir and M. Farach -- Suffix tree data structures for matrices / R. Giancarlo and R. Grossi -- Tree pattern matching / K. Zhang and D. Shasa.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This text provides an overview of the current state of pattern matching as seen by specialists who have devoted years of study to the field. It covers most of the basic principles and presents material from the frontier of research.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer algorithms.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh91000149</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Combinatorial analysis.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85028802</subfield></datafield><datafield tag="650" ind1=" " ind2="2"><subfield code="a">Algorithms</subfield><subfield code="0">https://id.nlm.nih.gov/mesh/D000465</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Algorithmes.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Analyse combinatoire.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithms.</subfield><subfield code="2">aat</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Optical Data Processing.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Combinatorial analysis</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="2">gnd</subfield><subfield code="0">http://d-nb.info/gnd/4001183-5</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mustervergleich</subfield><subfield code="2">gnd</subfield><subfield code="0">http://d-nb.info/gnd/4307192-2</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mustererkennung</subfield><subfield code="2">gnd</subfield><subfield code="0">http://d-nb.info/gnd/4040936-3</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Combinatória.</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Apostolico, Alberto,</subfield><subfield code="d">1948-</subfield><subfield code="0">http://id.loc.gov/authorities/names/n85091749</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Galil, Zvi.</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Pattern matching algorithms (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCG3Rm8yghytb4tmJCTr6Xb</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="t">Pattern matching algorithms.</subfield><subfield code="d">New York : Oxford University Press, 1997</subfield><subfield code="z">9780195113679</subfield><subfield code="w">(DLC) 96049602</subfield><subfield code="w">(OCoLC)35928466</subfield></datafield><datafield tag="856" ind1="1" ind2=" "><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=151292</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="1" ind2=" "><subfield code="l">CBO01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=151292</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10358422</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">151292</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">45391</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">2629251</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">3158746</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">2405256</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield></record></collection>
id	ZDB-4-EBA-ocn666957542
illustrated	Illustrated
indexdate	2024-10-25T16:17:49Z
institution	BVB
isbn	1423759702 9781423759706 1602561915 9781602561915 1280453915 9781280453915 9786610453917 6610453918 0195354346 9780195354348
language	English
oclc_num	666957542
open_access_boolean
owner	MAIN
owner_facet	MAIN
physical	1 online resource (377 pages :)
psigel	ZDB-4-EBA
publishDate	1997
publishDateSearch	1997
publishDateSort	1997
publisher	Oxford University Press,
record_format	marc
spelling	Pattern matching algorithms / edited by Alberto Apostolico, Zvi Galil. New York : Oxford University Press, 1997. 1 online resource (377 pages :) text txt rdacontent computer c rdamedia online resource cr rdacarrier Includes bibliographical references and index. Off-line serial exact string searching / M. Crochemore -- Off-line parallel exact string searching / Z. Galil and I. Yudkiewicz -- On-line string searching / A. Apostolico -- Serial computations of Levenshtein distances / D.S. Hirschberg -- Parallel computations of Levenshtein distances / A. Apostolico and M.J. Atallah -- Approximate string searching / G.M. Landau and U. Vishkin -- Dynamic programming : special cases / R. Giancarlo -- Shortest common superstrings / M. Li and T. Jiang -- Two dimensional matching / A. Amir and M. Farach -- Suffix tree data structures for matrices / R. Giancarlo and R. Grossi -- Tree pattern matching / K. Zhang and D. Shasa. This text provides an overview of the current state of pattern matching as seen by specialists who have devoted years of study to the field. It covers most of the basic principles and presents material from the frontier of research. English. Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Combinatorial analysis. http://id.loc.gov/authorities/subjects/sh85028802 Algorithms https://id.nlm.nih.gov/mesh/D000465 Algorithmes. Analyse combinatoire. algorithms. aat COMPUTERS Optical Data Processing. bisacsh Combinatorial analysis fast Computer algorithms fast Algorithmus gnd http://d-nb.info/gnd/4001183-5 Mustervergleich gnd http://d-nb.info/gnd/4307192-2 Mustererkennung gnd http://d-nb.info/gnd/4040936-3 Combinatória. larpcal Apostolico, Alberto, 1948- http://id.loc.gov/authorities/names/n85091749 Galil, Zvi. has work: Pattern matching algorithms (Text) https://id.oclc.org/worldcat/entity/E39PCG3Rm8yghytb4tmJCTr6Xb https://id.oclc.org/worldcat/ontology/hasWork Print version: Pattern matching algorithms. New York : Oxford University Press, 1997 9780195113679 (DLC) 96049602 (OCoLC)35928466 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=151292 Volltext CBO01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=151292 Volltext
spellingShingle	Pattern matching algorithms / Off-line serial exact string searching / M. Crochemore -- Off-line parallel exact string searching / Z. Galil and I. Yudkiewicz -- On-line string searching / A. Apostolico -- Serial computations of Levenshtein distances / D.S. Hirschberg -- Parallel computations of Levenshtein distances / A. Apostolico and M.J. Atallah -- Approximate string searching / G.M. Landau and U. Vishkin -- Dynamic programming : special cases / R. Giancarlo -- Shortest common superstrings / M. Li and T. Jiang -- Two dimensional matching / A. Amir and M. Farach -- Suffix tree data structures for matrices / R. Giancarlo and R. Grossi -- Tree pattern matching / K. Zhang and D. Shasa. Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Combinatorial analysis. http://id.loc.gov/authorities/subjects/sh85028802 Algorithms https://id.nlm.nih.gov/mesh/D000465 Algorithmes. Analyse combinatoire. algorithms. aat COMPUTERS Optical Data Processing. bisacsh Combinatorial analysis fast Computer algorithms fast Algorithmus gnd http://d-nb.info/gnd/4001183-5 Mustervergleich gnd http://d-nb.info/gnd/4307192-2 Mustererkennung gnd http://d-nb.info/gnd/4040936-3 Combinatória. larpcal
subject_GND	http://id.loc.gov/authorities/subjects/sh91000149 http://id.loc.gov/authorities/subjects/sh85028802 https://id.nlm.nih.gov/mesh/D000465 http://d-nb.info/gnd/4001183-5 http://d-nb.info/gnd/4307192-2 http://d-nb.info/gnd/4040936-3
title	Pattern matching algorithms /
title_auth	Pattern matching algorithms /
title_exact_search	Pattern matching algorithms /
title_full	Pattern matching algorithms / edited by Alberto Apostolico, Zvi Galil.
title_fullStr	Pattern matching algorithms / edited by Alberto Apostolico, Zvi Galil.
title_full_unstemmed	Pattern matching algorithms / edited by Alberto Apostolico, Zvi Galil.
title_short	Pattern matching algorithms /
title_sort	pattern matching algorithms
topic	Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Combinatorial analysis. http://id.loc.gov/authorities/subjects/sh85028802 Algorithms https://id.nlm.nih.gov/mesh/D000465 Algorithmes. Analyse combinatoire. algorithms. aat COMPUTERS Optical Data Processing. bisacsh Combinatorial analysis fast Computer algorithms fast Algorithmus gnd http://d-nb.info/gnd/4001183-5 Mustervergleich gnd http://d-nb.info/gnd/4307192-2 Mustererkennung gnd http://d-nb.info/gnd/4040936-3 Combinatória. larpcal
topic_facet	Computer algorithms. Combinatorial analysis. Algorithms Algorithmes. Analyse combinatoire. algorithms. COMPUTERS Optical Data Processing. Combinatorial analysis Computer algorithms Algorithmus Mustervergleich Mustererkennung Combinatória.
url	https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=151292
work_keys_str_mv	AT apostolicoalberto patternmatchingalgorithms AT galilzvi patternmatchingalgorithms

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Volltext öffnen

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge