skip to main content
Idioma:

Combinatorial pattern matching 17th annual symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006 proceedings

Symposium on Combinatorial Pattern Matching (17th 2006 Barcelona, Spain) Moshe Lewenstein; Gabriel Valiente 1963

Berlin Springer New York c2006

Localização: ICMC - Inst. Ciên. Mat. Computação    (68-02 LNCS v.4009 ) e outros locais(Acessar)

  • Título:
    Combinatorial pattern matching 17th annual symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006 proceedings
  • Autor: Symposium on Combinatorial Pattern Matching (17th 2006 Barcelona, Spain)
  • Moshe Lewenstein; Gabriel Valiente 1963
  • Assuntos: COMBINATÓRIA PROBABILÍSTICA (CONGRESSOS); Computer algorithms -- Congresses; Combinatorial analysis -- Congresses; Algorithmes -- Congr es; Analyse combinatoire -- Congr es
  • Notas: Includes bibliographical references and index
  • Descrição: Asynchronous pattern matching / Amihood Amir -- SNP and haplotype analysis - algorithms and applications / Eran Halperin -- Identifying co-referential names across large corpora / Levon Lloyd, Andrew Mehler Steven Skiena -- Adaptive searching in succinctly encoded binary relations and tree-structured documents / Jeremy Barbay, Alexander Golynski, J Ian Munro, S. Srinivasa Rao -- Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE / Johannes Fischer, Volker Heun -- A linear size index for approximate pattern matching / Ho-Leung Chan, Tak-Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Swee-Seong Wong -- On-line linear-time construction of word suffix trees / Shunsuke Inenaga, Masayuki Takeda -- Obtaining provably good performance from suffix trees in secondary storage / Pang Ko, Srinivas Aluru -- Geometric suffix tree: a new index structure for protein 3-D structures / Tetsuo Shibuya -- New bounds for motif finding in strong instances / Brona Brejova, Daniel G. Brown, Ian M. Harrower, Tomas Vinar -- Fingerprint clustering with bounded number of missing values / Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Giancarlo Mauri -- Tiling and interval of discrete line / Olivier Bodini, Eric Rivals -- Common substrings in random strings / Eric Blais, Mathieu Blanchette -- On the repeat-annotated phylogenetic tree reconstruction problem / Firas Swidan, Michal Ziv-Ukelson, Ron Y. Pinter -- Subsequence combinatorics and applications to microarray production, DNA sequencing and chaining algorithms / Sven Rahmann -- Solving the maximum agreement subtree and the maximum compatible tree problems on many bounded degree trees / Sylvain Guillemot, Francois Nicolas -- An improved algorithm for the macro-evolutionary phylogeny problem / Behshad Behzadi, Martin Vingron.
    Property matching and weighted matching / Amihood Amir, Eran Chencinski, Costas Iliopoulos, Tsvi Kopelowitz, Hui Zhang -- Faster two dimensional scaled matching / Amihood Amir, Eran Chencinski -- Approximation of RNA multiple structural alignment / Marcin Kubica, Romeo Rizzi, Stephane Vialette, Tomasz Walen -- Finding common RNA pseudoknot structures in polynomial time / Patricia A. Evans -- A compact mathematical programming formulation for DNA motif finding / Carl Kingsford, Elena Zaslavsky, Mona Singh -- Local alignment of RNA sequences with arbitrary scoring schemes / Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann -- An O(n3/2 [square root symbol] log(n)) algorithm for sorting by reciprocal translocations / Michal Ozery-Flato, Ron Shamir -- Longest common subsequences in permutations and maximum cliques in circle graphs / Alexander Tiskin -- A simpler analysis of Burrows-Wheeler based compression / Haim Kaplan, Shir Landau, Elad Verbin -- Statistical encoding of succinct data structures / Rodrigo Gonzalez, Gonzalo Navarro -- Dynamic entropy-compressed sequences and full-text indexes / Veli Makinen, Gonzalo Navarro -- Reducing the space requirement of LZ-index / Diego Arroyuelo, Gonzalo Navarro, Kunihiko Sadakane -- Faster algorithms for computing longest common increasing subsequesnces / Geth Stolting Brodal, Kanela Kaligosi, Irit Ktriel, Martin Kutz -- New algortithms for text fingerprinting / Roman Kolpakov, Mathiew Raffinot -- Sublinear algorithms for parameterized matching / Leena Salmela, Jorma Tarhio -- Approximate matching in weighted sequesnces / Amihood Amir, Costas Iliopoulos, Oren Kapah, Ely Porat -- Algorithms for finding a most similar subforest / Jesper Jansson, Zeshan Peng -- Efficient algorithms for regular expression constrained sequence alignment / Yun-Sheng Chung, Chin Lung Lu, Chuan Yi Tang -- Large scale matching for position weight matrices / Aude Liefooghe, Helene Touzet, Jean-Stephane Varre
  • Títulos relacionados: Série:Lecture notes in computer science 4009
  • Editor: Berlin Springer New York
  • Data de criação/publicação: c2006
  • Formato: xii, 414 p ill 24 cm.
  • Idioma: Inglês
Links
Voltar para lista de resultados

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.