Combinatorial Pattern Matching: 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010, Proceedings

Combinatorial Pattern Matching: 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010, Proceedings

Amihood Amir Laxmi Parida , Laxmi Parida
아직 평점이 없습니다
2011 · 영어 · 페이퍼백
서가에 추가

이 책 평가하기


도서 일지 내보내기

설명

This book constitutes the refereed proceedings of the 21st Annual Symposium on Combinatorial Pattern Matching, CPM 2010, held in New York, USA, in June 2010. The 28 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 53 submissions. The papers address all areas related to combinatorial pattern matching and its applications, such as searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays with special focus on coding and data compression, computational biology, data mining, information retrieval, natural language processing, pattern recognition, string algorithms, string processing in databases, symbolic computing and text searching.

책 세부 정보

형식 페이퍼백
페이지 378 페이지
언어 영어
출판됨 Jan 1, 2011
출판사 Springer
ISBN-10 3642135102
ISBN-13 9783642135101

장르들

서가에 추가

이 책 평가하기


도서 일지 내보내기