LEADER 04130nam  22008175  450 
001 996465698103316
005 20230223051405.0
010   $a3-642-38905-8
024 7 $a10.1007/978-3-642-38905-4
035   $a(CKB)3280000000007675
035   $a(DE-He213)978-3-642-38905-4
035   $a(SSID)ssj0000904560
035   $a(PQKBManifestationID)11512238
035   $a(PQKBTitleCode)TC0000904560
035   $a(PQKBWorkID)10921679
035   $a(PQKB)11277585
035   $a(MiAaPQ)EBC3096946
035   $a(PPN)170492893
035   $a(EXLCZ)993280000000007675
100   $a20130517d2013      u|             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aCombinatorial Pattern Matching$b[electronic resource] $e24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013, Proceedings /$fedited by Johannes Fischer, Peter Sanders
205   $a1st ed. 2013.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2013.
215   $a1 online resource (X, 259 p. 58 illus.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7922
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-642-38904-X 
327   $aSearching and matching strings and more complicated patterns.-  Trees, regular expressions, graphs, point sets, and arrays.-  Non-trivial combinatorial properties of such structures.- Problems in computational biology -- Data compression and data mining -- Coding -- Information retrieval -- Natural language processing -- Pattern recognition.
330   $aThis book constitutes the refereed proceedings of the 24th Annual Symposium on Combinatorial Pattern Matching, CPM 2013, held in Bad Herrenalb (near Karlsruhe), Germany, in June 2013. The 21 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 51 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problem or pinpoint conditions under which searches cannot be performed efficiently. The meeting also deals with problems in computational biology, data compression and data mining, coding, information retrieval, natural language processing, and pattern recognition.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7922
606   $aPattern recognition systems
606   $aAlgorithms
606   $aNumerical analysis
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aArtificial intelligence?Data processing
606   $aBioinformatics
606   $aAutomated Pattern Recognition
606   $aAlgorithms
606   $aNumerical Analysis
606   $aDiscrete Mathematics in Computer Science
606   $aData Science
606   $aComputational and Systems Biology
615  0$aPattern recognition systems.
615  0$aAlgorithms.
615  0$aNumerical analysis.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615  0$aArtificial intelligence?Data processing.
615  0$aBioinformatics.
615 14$aAutomated Pattern Recognition.
615 24$aAlgorithms.
615 24$aNumerical Analysis.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aData Science.
615 24$aComputational and Systems Biology.
676   $a005.1
702   $aFischer$b Johannes$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aSanders$b Peter$4edt$4http://id.loc.gov/vocabulary/relators/edt
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996465698103316
996   $aCombinatorial Pattern Matching$9772744
997   $aUNISA