Sprache: Englisch
Verlag: Springer, 2007
Anbieter: Antiquariat Thomas Haker GmbH & Co. KG, Berlin, Deutschland
Verbandsmitglied: GIAQ
Softcover/Paperback. Zustand: Sehr gut. 380 p. Very good. Shrink wrapped. / Sehr guter Zustand. In Folie verschweißt. Sprache: Englisch Gewicht in Gramm: 685.
Sprache: Englisch
Verlag: Springer-Verlag New York Inc, 2007
ISBN 10: 3540734368 ISBN 13: 9783540734369
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 79,90
Anzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 1st edition. 366 pages. 9.25x6.25x1.00 inches. In Stock.
Sprache: Englisch
Verlag: Springer, Berlin, Springer Berlin Heidelberg, Springer, 2007
ISBN 10: 3540734368 ISBN 13: 9783540734369
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The papers contained in this volume were presented at the 18th Annual S- posium on Combinatorial Pattern Matching (CPM 2007) held at the University of Western Ontario, in London, Ontario, Canada from July 9 to 11, 2007. All the papers presented at the conference are original research contri- tions on computational pattern matching and analysis, data compression and compressed text processing, su x arrays and trees, and computational biology. They were selected from 64 submissions. Each submission was reviewed by at least three reviewers. The committee decided to accept 32 papers. The p- gramme also included three invited talks by Tao Jiang from the University of California, Riverside, USA, S. Muthukrishnan from Rutgers University, USA, and Frances Yao from City University of Hong Kong, Hong Kong. Combinatorial Pattern Matching addresses issues of searching and matching stringsandmorecomplicatedpatternssuchastrees,regularexpressions,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 problems or pinpoint conditions under which searches cannot be performed e ciently.