Search results for "CPM"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Amihood Amir, Oren Kapah, Ely Porat	Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications.	CPM	2007	DBLP DOI BibTeX RDF
1	Niko Välimäki, Veli Mäkinen	Space-Efficient Algorithms for Document Retrieval.	CPM	2007	DBLP DOI BibTeX RDF
1	Haim Kaplan, Elad Verbin	Most Burrows-Wheeler Based Compressors Are Not Optimal.	CPM	2007	DBLP DOI BibTeX RDF
1	Peter Clifford, Raphaël Clifford	Self-normalised Distance with Don't Cares.	CPM	2007	DBLP DOI BibTeX RDF	Classification Algorithms and data structures, pattern matching, string algorithms
1	Yury Lifshits	Processing Compressed Texts: A Tractability Border.	CPM	2007	DBLP DOI BibTeX RDF
1	Jing Zhang 0012, Xi Chen 0001, Ming Li 0001	Computing Exact p-Value for Structured Motif.	CPM	2007	DBLP DOI BibTeX RDF	Pattern and motif discovery, exact p-value, dynamic programming, structured motif
1	Frances F. Yao	Algorithmic Problems in Scheduling Jobs on Variable-Speed Processors.	CPM	2007	DBLP DOI BibTeX RDF
1	Bin Ma 0002, Kaizhong Zhang (eds.)	Combinatorial Pattern Matching, 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings	CPM	2007	DBLP DOI BibTeX RDF
1	Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette	Common Structured Patterns in Linear Graphs: Approximation and Combinatorics.	CPM	2007	DBLP DOI BibTeX RDF
1	Travis Gagie, Giovanni Manzini	Move-to-Front, Distance Coding, and Inversion Frequencies Revisited.	CPM	2007	DBLP DOI BibTeX RDF
1	Carmel Kent, Moshe Lewenstein, Dafna Sheinwald	On Demand String Sorting over Unbounded Alphabets.	CPM	2007	DBLP DOI BibTeX RDF
1	Ely Porat, Ohad Lipsky	Improved Sketching of Hamming Distance with Error Correcting.	CPM	2007	DBLP DOI BibTeX RDF
1	Paolo Ferragina, Johannes Fischer 0001	Suffix Arrays on Words.	CPM	2007	DBLP DOI BibTeX RDF
1	Sylvain Guillemot, Vincent Berry	Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem.	CPM	2007	DBLP DOI BibTeX RDF
1	Maxime Benoît-Gagné, Sylvie Hamel	A New and Faster Method of Sorting by Transpositions.	CPM	2007	DBLP DOI BibTeX RDF	transposition distance, permutation, Genome rearrangement
1	Jianbo Qian, Shuai Cheng Li 0001, Dongbo Bu, Ming Li 0001, Jinbo Xu	Finding Compact Structural Motifs.	CPM	2007	DBLP DOI BibTeX RDF
1	Gang Chen, Simon J. Puglisi, William F. Smyth	Fast and Practical Algorithms for Computing All the Runs in a String.	CPM	2007	DBLP DOI BibTeX RDF
1	Yufeng Wu, Dan Gusfield	Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants.	CPM	2007	DBLP DOI BibTeX RDF
1	S. Muthukrishnan 0001	Stringology: Some Classic and Some Modern Problems.	CPM	2007	DBLP DOI BibTeX RDF
1	Zhixiang Chen 0001, Bin Fu, Jinhui Xu 0001, Bo-Ting Yang, Zhiyu Zhao, Binhai Zhu	Non-breaking Similarity of Genomes with Gene Repetitions.	CPM	2007	DBLP DOI BibTeX RDF
1	Wangsen Feng, Zhanyong Wang, Lusheng Wang 0001	Identification of Distinguishing Motifs.	CPM	2007	DBLP DOI BibTeX RDF	motif detection, two groups, EM Algorithms
1	Zeshan Peng, Hing-Fung Ting	Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge.	CPM	2007	DBLP DOI BibTeX RDF
1	Wing-Kai Hon, Tak Wah Lam, Rahul Shah 0001, Siu-Lung Tam, Jeffrey Scott Vitter	Cache-Oblivious Index for Approximate String Matching.	CPM	2007	DBLP DOI BibTeX RDF
1	Rodrigo González, Gonzalo Navarro 0001	Compressed Text Indexes with Fast Locate.	CPM	2007	DBLP DOI BibTeX RDF
1	Amihood Amir, Johannes Fischer 0001, Moshe Lewenstein	Two-Dimensional Range Minimum Queries.	CPM	2007	DBLP DOI BibTeX RDF
1	Dong Kyue Kim, Joong Chae Na, Jeong Seop Sim, Kunsoo Park	A Simple Construction of Two-Dimensional Suffix Trees in Linear Time.	CPM	2007	DBLP DOI BibTeX RDF
1	Philip Bille, Rolf Fagerberg, Inge Li Gørtz	Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts.	CPM	2007	DBLP DOI BibTeX RDF
1	Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur	Finding Witnesses by Peeling.	CPM	2007	DBLP DOI BibTeX RDF
1	Juhani Karhumäki, Yury Lifshits, Wojciech Rytter	Tiling Periodicity.	CPM	2007	DBLP DOI BibTeX RDF
1	Shay Mozes, Oren Weimann, Michal Ziv-Ukelson	Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions.	CPM	2007	DBLP DOI BibTeX RDF	dynamic programming, HMM, compression, Viterbi
1	Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen	Algorithms for Computing the Longest Parameterized Common Subsequence.	CPM	2007	DBLP DOI BibTeX RDF
1	Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda	Efficient Computation of Substring Equivalence Classes with Suffix Arrays.	CPM	2007	DBLP DOI BibTeX RDF
1	Tao Jiang 0001	A Combinatorial Approach to Genome-Wide Ortholog Assignment: Beyond Sequence Similarity Search.	CPM	2007	DBLP DOI BibTeX RDF
1	Diego Arroyuelo, Gonzalo Navarro 0001	A Lempel-Ziv Text Index on Secondary Storage.	CPM	2007	DBLP DOI BibTeX RDF
1	Sunho Lee, Kunsoo Park	Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts.	CPM	2007	DBLP DOI BibTeX RDF
1	Amihood Amir, Eran Chencinski	Faster Two Dimensional Scaled Matching.	CPM	2006	DBLP DOI BibTeX RDF
1	Alexandre Tiskin	Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs.	CPM	2006	DBLP DOI BibTeX RDF
1	Leena Salmela, Jorma Tarhio	Sublinear Algorithms for Parameterized Matching.	CPM	2006	DBLP DOI BibTeX RDF
1	Diego Arroyuelo, Gonzalo Navarro 0001, Kunihiko Sadakane	Reducing the Space Requirement of LZ-Index.	CPM	2006	DBLP DOI BibTeX RDF
1	Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann	Local Alignment of RNA Sequences with Arbitrary Scoring Schemes.	CPM	2006	DBLP DOI BibTeX RDF
1	Roman Kolpakov, Mathieu Raffinot	New Algorithms for Text Fingerprinting.	CPM	2006	DBLP DOI BibTeX RDF
1	Rodrigo González, Gonzalo Navarro 0001	Statistical Encoding of Succinct Data Structures.	CPM	2006	DBLP DOI BibTeX RDF
1	Pang Ko, Srinivas Aluru	Obtaining Provably Good Performance from Suffix Trees in Secondary Storage.	CPM	2006	DBLP DOI BibTeX RDF
1	Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang 0004	Property Matching and Weighted Matching.	CPM	2006	DBLP DOI BibTeX RDF
1	Shunsuke Inenaga, Masayuki Takeda	On-Line Linear-Time Construction of Word Suffix Trees.	CPM	2006	DBLP DOI BibTeX RDF
1	Jesper Jansson 0001, Zeshan Peng	Algorithms for Finding a Most Similar Subforest.	CPM	2006	DBLP DOI BibTeX RDF
1	Eric Blais, Mathieu Blanchette	Common Substrings in Random Strings.	CPM	2006	DBLP DOI BibTeX RDF
1	Amihood Amir	Asynchronous Pattern Matching.	CPM	2006	DBLP DOI BibTeX RDF
1	Ho-Leung Chan, Tak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Swee-Seong Wong	A Linear Size Index for Approximate Pattern Matching.	CPM	2006	DBLP DOI BibTeX RDF
1	Johannes Fischer 0001, Volker Heun	Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE.	CPM	2006	DBLP DOI BibTeX RDF
1	Behshad Behzadi, Martin Vingron	An Improved Algorithm for the Macro-evolutionary Phylogeny Problem.	CPM	2006	DBLP DOI BibTeX RDF
1	Firas Swidan, Michal Ziv-Ukelson, Ron Y. Pinter	On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem.	CPM	2006	DBLP DOI BibTeX RDF
1	Carl Kingsford, Elena Zaslavsky, Mona Singh 0001	A Compact Mathematical Programming Formulation for DNA Motif Finding.	CPM	2006	DBLP DOI BibTeX RDF
1	Sylvain Guillemot, François Nicolas	Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees.	CPM	2006	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz	Faster Algorithms for Computing Longest Common Increasing Subsequences.	CPM	2006	DBLP DOI BibTeX RDF
1	Olivier Bodini, Eric Rivals	Tiling an Interval of the Discrete Line.	CPM	2006	DBLP DOI BibTeX RDF
1	Veli Mäkinen, Gonzalo Navarro 0001	Dynamic Entropy-Compressed Sequences and Full-Text Indexes.	CPM	2006	DBLP DOI BibTeX RDF
1	Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao 0001	Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents.	CPM	2006	DBLP DOI BibTeX RDF	intersection problem, multi-labeled trees, conjunctive queries, succinct data structures, labeled trees
1	Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen	Approximation of RNA Multiple Structural Alignment.	CPM	2006	DBLP DOI BibTeX RDF
1	Sven Rahmann	Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms.	CPM	2006	DBLP DOI BibTeX RDF
1	Brona Brejová, Daniel G. Brown 0001, Ian M. Harrower, Tomás Vinar	New Bounds for Motif Finding in Strong Instances.	CPM	2006	DBLP DOI BibTeX RDF
1	Patricia A. Evans	Finding Common RNA Pseudoknot Structures in Polynomial Time.	CPM	2006	DBLP DOI BibTeX RDF
1	Aude Liefooghe, Hélène Touzet, Jean-Stéphane Varré	Large Scale Matching for Position Weight Matrices.	CPM	2006	DBLP DOI BibTeX RDF
1	Amihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat	Approximate Matching in Weighted Sequences.	CPM	2006	DBLP DOI BibTeX RDF
1	Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Giancarlo Mauri	Fingerprint Clustering with Bounded Number of Missing Values.	CPM	2006	DBLP DOI BibTeX RDF
1	Moshe Lewenstein, Gabriel Valiente (eds.)	Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings	CPM	2006	DBLP DOI BibTeX RDF
1	Haim Kaplan, Shir Landau, Elad Verbin	A Simpler Analysis of Burrows-Wheeler Based Compression.	CPM	2006	DBLP DOI BibTeX RDF
1	Levon Lloyd, Andrew Mehler, Steven Skiena	Identifying Co-referential Names Across Large Corpora.	CPM	2006	DBLP DOI BibTeX RDF
1	Michal Ozery-Flato, Ron Shamir	An O(n3/2sqrt(log n)) Algorithm for Sorting by Reciprocal Translocations.	CPM	2006	DBLP DOI BibTeX RDF
1	Eran Halperin	SNP and Haplotype Analysis - Algorithms and Applications.	CPM	2006	DBLP DOI BibTeX RDF
1	Tetsuo Shibuya	Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures.	CPM	2006	DBLP DOI BibTeX RDF
1	Yun Sheng Chung, Chin Lung Lu, Chuan Yi Tang	Efficient Algorithms for Regular Expression Constrained Sequence Alignment.	CPM	2006	DBLP DOI BibTeX RDF
1	Mary Ellen Bock, Guido Maria Cortelazzo, Carlo Ferrari, Concettina Guerra	Identifying Similar Surface Patches on Proteins Using a Spin-Image Surface Representation.	CPM	2005	DBLP DOI BibTeX RDF
1	François Nicolas, Eric Rivals	Hardness of Optimal Spaced Seed Design.	CPM	2005	DBLP DOI BibTeX RDF
1	Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson	On the Complexity of Sparse Exon Assembly.	CPM	2005	DBLP DOI BibTeX RDF
1	Moritz G. Maaß, Johannes Nowak	Text Indexing with Errors.	CPM	2005	DBLP DOI BibTeX RDF
1	Hélène Touzet	A Linear Tree Edit Distance Algorithm for Similar Ordered Trees.	CPM	2005	DBLP DOI BibTeX RDF
1	Abdullah N. Arslan	Regular Expression Constrained Sequence Alignment.	CPM	2005	DBLP DOI BibTeX RDF	dynamic programming, pattern matching, Regular expression, sequence alignment, finite automaton
1	Alberto Apostolico, Maxime Crochemore, Kunsoo Park (eds.)	Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings	CPM	2005	DBLP DOI BibTeX RDF
1	Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski	Approximate Matching in the L1 Metric.	CPM	2005	DBLP DOI BibTeX RDF
1	Shiri Dori, Gad M. Landau	Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets.	CPM	2005	DBLP DOI BibTeX RDF
1	Kazuhide Aikou, Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara	A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables.	CPM	2005	DBLP DOI BibTeX RDF
1	Yo-Sub Han, Yajun Wang, Derick Wood	Prefix-Free Regular-Expression Matching.	CPM	2005	DBLP DOI BibTeX RDF
1	Carmit Hazay, Moshe Lewenstein, Dekel Tsur	Two Dimensional Parameterized Matching.	CPM	2005	DBLP DOI BibTeX RDF
1	David Fernández-Baca, Balaji Venkatachalam	Parametric Analysis for Ungapped Markov Models of Evolution.	CPM	2005	DBLP DOI BibTeX RDF
1	Jijun Tang, Bernard M. E. Moret	Linear Programming for Phylogenetic Reconstruction Based on Gene Rearrangements.	CPM	2005	DBLP DOI BibTeX RDF
1	Zheng Liu, Xin Chen 0037, James Borneman, Tao Jiang 0001	A Fast Algorithm for Approximate String Matching on Gene Sequences.	CPM	2005	DBLP DOI BibTeX RDF
1	Sebastian Böcker, Hans-Michael Kaltenbach	Mass Spectra Alignments and Their Significance.	CPM	2005	DBLP DOI BibTeX RDF
1	Meng Zhang 0006, Liang Hu 0001, Qiang Li 0008, Jiubin Ju	Weighted Directed Word Graph.	CPM	2005	DBLP DOI BibTeX RDF
1	Ion I. Mandoiu, Dragos Trinca	Exact and Approximation Algorithms for DNA Tag Set Design.	CPM	2005	DBLP DOI BibTeX RDF
1	Nadia Pisanti, Henry Soldano, Mathilde Carpentier	Incremental Inference of Relational Motifs with a Degenerate Alphabet.	CPM	2005	DBLP DOI BibTeX RDF
1	Paul Horton, Wataru Fujibuchi	An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery.	CPM	2005	DBLP DOI BibTeX RDF
1	Valentina Boeva, Julien Clément 0001, Mireille Régnier, Mathias Vandenbogaert	Assessing the Significance of Sets of Words.	CPM	2005	DBLP DOI BibTeX RDF
1	Veli Mäkinen, Gonzalo Navarro 0001	Succinct Suffix Arrays Based on Run-Length Encoding.	CPM	2005	DBLP DOI BibTeX RDF
1	Kangmin Fan, William F. Smyth, R. J. Simpson	A New Periodicity Lemma.	CPM	2005	DBLP DOI BibTeX RDF
1	Brona Brejová, Daniel G. Brown 0001, Ian M. Harrower, Alejandro López-Ortiz, Tomás Vinar	Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern.	CPM	2005	DBLP DOI BibTeX RDF
1	Behshad Behzadi, Fabrice Le Fessant	DNA Compression Challenge Revisited: A Dynamic Programming Approach.	CPM	2005	DBLP DOI BibTeX RDF
1	Tatsuya Akutsu, Daiji Fukagawa	Inferring a Graph from Path Frequency.	CPM	2005	DBLP DOI BibTeX RDF
1	Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathrin Hockel, Jan Stallkamp	The Median Problem for the Reversal Distance in Circular Bacterial Genomes.	CPM	2005	DBLP DOI BibTeX RDF
1	Gad M. Landau, Laxmi Parida, Oren Weimann	Using PQ Trees for Comparative Genomics.	CPM	2005	DBLP DOI BibTeX RDF	permutation patterns, PQ trees, whole genome analysis, evolutionary analysis, data mining, clusters, patterns, Pattern discovery, comparative genomics, motifs

Publications at "CPM"( http://dblp.L3S.de/Venues/CPM )