- String Matching in Hardware using the FM-Index Edward Fernandez, Walid Najjar and Stefano Lonardi
- Oxford University Press 2005 1 BIOINFORMATICS APPLICATIONS NOTE
- May 17, 2007 13:34 WSPC/Trim Size: 11in x 8.5in for Proceedings mcts Efficient Algorithms for Genome-Wide TagSNP Selection across Populations via the Linkage
- A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach
- Discovery of Repetitive Patterns in DNA with Accurate Boundaries Jie Zheng Stefano Lonardi
- A linear delay algorithm for building concept lattices
- Cover Array String Reconstruction Maxime Crochemore1,2, Costas Iliopoulos1,3, Solon Pissis1,
- Processing Compressed Texts: A Tractability Border
- On Average Sequence Complexity Svante Janson
- BioMed Central Page 1 of 13
- Improved Single and Multiple Approximate String Matching
- Constrained Tree Inclusion 14th Annual Symposium on Combinatorial Pattern Matching
- Towards a solution to the "runs" MAXIME CROCHEMORE
- Twenty years of CPM Elena Yavorska Harrisa
- Statistical Analysis of Sequences January 22, 2011
- Fixed-parameter tractability of the Maximum Agreement Supertree problem
- Towards Parameter-Free Data Mining Eamonn Keogh Stefano Lonardi Chotirat Ann Ratanamahatana
- Bidirectional Search in a String with Wavelet Trees Thomas Schnattinger
- Bounds on the Minimum Mosaic of Sequences Under Recombination
- Tiling an interval of the discrete line Olivier Bodini, Eric Rivals
- Opportunistic Data Structures with Applications Paolo Ferragina
- A Compartmentalized Approach to the Assembly of Physical Maps Serdar Bozdag, Timothy J Close and Stefano Lonardi
- DNA Compression Challenge Revisited: a Dynamic Programming Approach
- 10.1101/gr.101063.109Access the most recent version at doi: published online January 6, 2010Genome Res.
- *Corresponding author. E-mail: psomma@garda-access.com Signal Processing: Image Communication 14 (1999) 413--423
- Geometric Suffix Tree: A New Index Structure for
- Gridding and Compression of Microarray Images Stefano Lonardi and Yu Luo
- On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs
- Theoretical Computer Science 368 (2006) 217230 www.elsevier.com/locate/tcs
- Complexities of the Centre and Median String Francois Nicolas (nicolas@lirmm.fr) and Eric Rivals (rivals@lirmm.fr)
- CS 141, Fall 2004 Warm-up questions Here are some problems to warm up for quiz 1.
- Inferring a Graph from Path Frequency
- BioMed Central Page 1 of 13
- Statement of the problem Dense-tree encodings
- Compression, Indexing, and Retrieval for Massive String Datag
- Lille 24/06/2009 CPM'09 The Structure of Level-k
- Approximate AllPairs Suffix/Prefix Overlaps Niko Vlimki
- On the Value of Multiple Read/Write Streams for Data Compression
- Finding Optimal Alignment and Consensus of Circular Strings
- A linear-time algorithm for comparing similar ordered Hel`ene Touzet
- An(other) Entropy-Bounded Compressed Suffix Tree
- Data Min Knowl Disc DOI 10.1007/s10618-006-0049-3
- An efficient matching algorithm for encoded DNA sequences and binary strings
- Computational Methods for the Analysis of Biomecular Data
- Laboratoire d'Informatique,
- CS 260-1: \Pattern Discovery in Biosequences" Reading list
- A Compact Mathematical Programming Formulation for DNA Motif Finding
- On Compact Representations of AllPairsShortestPath
- Time-series Bitmaps: A Practical Visualization Tool for working with Large Time Series Databases
- Probabilistic Discovery of Time Series MotifsKDD ID 281 Bill Chiu Eamonn Keogh Stefano Lonardi
- May 8, 2007 11:39 WSPC/Trim Size: 11in x 8.5in for Proceedings csb07ws DECONVOLUTING THE BAC-GENE RELATIONSHIPS USING A PHYSICAL MAP
- Clock-Frequency Assignment for Multiple Clock Domain Systems-on-a-Chip Modern systems-on-a-chip platforms support multiple clock
- Length-Based Encoding of Binary Data in DNA Nathaniel G. Portney, Yonghui Wu, Lauren K. Quezada,# Stefano Lonardi, and
- Introduction to RMQs Solution Methods
- Inference with Constraints
- Tree edit distance analysis Serge Dulucq (LABRI)
- Strong motifs are easy to find cheriton school of computer science
- CS141, Winter 2004 Project 3 This assignment is due March 11th, 2004, 11:59pm (Pacific Time). Do not wait until the
- Off-Line Compression by Greedy Textual Substitution
- Efficient and Accurate Construction of Genetic Linkage Maps from Noisy and Missing Genotyping Data
- Soft-core Processor Customization using the Design of Experiments David Sheldon, Frank Vahid*, Stefano Lonardi
- Semi-local string comparison Alexander Tiskin
- CS 260-1: \Pattern Discovery in Biosequences" Reading list
- Computational Design of New and Recombinant Selenoproteins
- Assumption-Free Anomaly Detection in Time Series Li Wei Nitin Kumar Venkata Lolla Eamonn Keogh Stefano Lonardi Chotirat Ann Ratanamahatana
- Intorduction Extensions of GRAPH MOTIF
- CS 234, Winter 2009 Midterm Name (first last) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
- Linear Programming for Phylogenetic Reconstruction
- EVOLUTION VERSUS "INTELLIGENT DESIGN": COMPARING THE TOPOLOGY OF PROTEIN-PROTEIN INTERACTION NETWORKS TO THE INTERNET
- Small phylogeny problem: character evolution trees
- Immune profile and mitotic index of metastatic melanoma lesions enhance clinical staging in
- Motif Discovery Upper Bound An Upper Bound on the Hardness of Exact Matrix
- JOURNAL OF COMPUTATIONAL BIOLOGY Volume 7, Numbers 1/2, 2000
- May 9, 2008 15:31 WSPC/Trim Size: 11in x 8.5in for Proceedings 059Lonardi ON THE ACCURATE CONSTRUCTION OF CONSENSUS GENETIC MAPS
- Motivation Parallel Compressed Indexes Distributed Compressed Indexes Conclusions Parallel and Distributed Compressed Indexes
- Sublinear Algorithms for Parameterized Matching Sublinear Algorithms for Parameterized Matching
- Computational Challenges in Barley
- Journal of Bioinformatics and Computational Biology Vol. 6, No. 3 (2008) 603622
- Fast RNA Structure Alignment for Crossing Input Structures
- Data Min Knowl Disc DOI 10.1007/s10618-007-0064-z
- Analysis of Secondary Structure Elements of Proteins Using Indexing Techniques
- Implicit Hitting Set Problems, Multi-Genome Alignment and
- Information Processing Letters 83 (2002) 159161 A speed-up for the commute between
- Online Information Compression in Sensor Networks Song Lin, Vana Kalogeraki, Dimitrios Gunopulos, Stefano Lonardi
- Efficient Algorithms for Finding Submasses in Weighted Strings
- Intro to Molecular Biology (all you need to know ... in about 130 slides)
- Faster Two Dimensional Pattern Matching with Rotations
- Some Theory and Practice Greedy Off-line Textual Substitution
- Nucleosome occupancy at transcription start sites in the human malaria parasite: A hard-wired evolution of virulence?
- April 9, 2008 22:0 WSPC/INSTRUCTION FILE PPIJBCB A LINEAR-TIME ALGORITHM FOR PREDICTING
- Linear Global Detectors of Redundant and Rare Substrings
- Int. J. Data Mining and Bioinformatics, Vol. 1, No. 3, 2007 241 Copyright 2007 Inderscience Enterprises Ltd.
- A Whole-Genome Assembly of Drosophila Eugene W. Myers,1
- A new and faster method of sorting by transpositions
- An exact and polynomial distance-based algorithm to
- Efficient Genome-Wide TagSNP Selection Across Populations via the Linkage Disequilibrium Criterion
- Algorithms for Three Versions of the Shortest Common Superstring
- Motivation Dynamic FCST's Conclusions Dynamic Fully-Compressed Suffix Trees
- Online Approximate Matching with Non-local Distances
- Exploration of Short Reads Genome Mapping in Hardware Edward Fernandez, Walid Najjar
- Novel Gene Discovery in the Human Malaria Parasite using Nucleosome Positioning Data N. Pokhriyal 2
- BIOINFORMATICS APPLICATIONS NOTE Sequence analysis
- Computing the Minimal Tiling Path from a Physical Map by Integer Linear Programming
- September 25, 2007 11:19 Proceedings Trim Size: 9in x 6in paper A PROBABILISTIC METHOD FOR SMALL RNA
- A Decomposition Approach for Discovering Network Building Blocks
- BioMed Central Page 1 of 7
- A Parallel Algorithm for Clustering Protein-Protein Interaction Networks
- BIOINFORMATICS Vol. 20 no. 13 2004, pages 21012112
- Efficient Selection of Unique and Popular Oligos for Large EST Databases
- JOURNAL OF COMPUTATIONAL BIOLOGY Volume 10, Numbers 34, 2003
- Intelligent Icons: Integrating Lite-Weight Data Mining and Visualization into GUI Operating Systems
- Data Mining and Knowledge Discovery, 13, 1140, 2006 c 2006 Springer Science + Business Media, LLC. Manufactured in the United States.
- Integrating Lite-Weight but Ubiquitous Data Mining into GUI Operating Systems
- T.B. Ho, D. Cheung, and H. Liu (Eds.): PAKDD 2005, LNAI 3518, pp. 771 777, 2005. Springer-Verlag Berlin Heidelberg 2005
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 5, MAY 2007 1799 Error Resilient LZ'77 Data Compression
- CONCURRENCY AND COMPUTATION: PRACTICE AND EXPERIENCE Concurrency Computat.: Pract. Exper. 2004; 16:10631076 (DOI: 10.1002/cpe.804)
- UNIVERSIT A DEGLI STUDI DI PADOVA DIPARTIMENTO DI INGEGNERIA ELETTRONICA
- Theoretical Computer Science 326 (2004) 213227 www.elsevier.com/locate/tcs
- ENCODING PYRAMIDS BY LABELING RAAM
- Advanced Topics in Computational Biology
- IsoLasso: A LASSO Regression Approach to RNA-Seq Based Transcriptome Assembly (Extended Abstract)
- Indexing Structure for Sequences February 10, 2011
- Biological Networks February 24, 2011
- Computer Engineering / Computer Science and Engineering / Business Informatics / 187 f) MATH 113
- Algorithms for Forest Pattern Matching Kaizhong Zhang and Yunkun Zhu
- Universitt Rostock Affine Image Matching is TC0
- Preprocessing Text Scanning
- Introduction The Algorithm
- Succinct dictionary matching with no slowdown Djamal Belazzougui, dbelaz@liafa.jussieu.fr
- Pseudo-realtime Pattern Matching: Closing the Gap
- Breakpoint distance and PQ-Trees (or: Comparing the Similarity
- HERD: The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection
- Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks
- Faculty of Science / Jouni Sirn / Sampled LCP Array 1June 23, 2010www.helsinki.fi/yliopisto Sampled LCP Array
- Aho-Corasick Algorithm Co-deterministic automaton A X Minimal automaton Complexity Conclusion
- Fast Searching in Packed Strings Philip Bille
- Permuted Longest-Common-Prefix Array Juha Karkkainen
- Introduction and Motivation Algorithms Conclusion Deconstructing Intractability: A Case Study for
- Multiple alignment of biological networks: a flexible approach
- Level-k Phylogenetic Networks are Constructable from a Dense Triplet Set in Polynomial Time
- Introduction All Sorting TDRLs Late Breaking Findings Results Finding All Sorting Tandem Duplication Random
- Average-case complexity analysis of perfect sorting by reversals
- Statistical Properties of Oracles Jrmie Bourdon1,2
- Probabilistic Arithmetic Automata and their Application to Pattern Matching Statistics
- Fast Algorithms for Computing Tree LCS Shay Mozes1
- Finding Witnesses by Peeling Yonatan Aumann1
- Cache-Oblivious Index Approximate String Matching
- Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel
- Self-normalised distance with don't cares Peter Clifford1 Raphal Clifford2
- Move-to-Front, Distance Coding
- Common Structured Patterns in Linear Graphs: Approximation and Combinatorics
- Longest common separable pattern among permutations
- A Linear Size Index Approximate String Matching
- Common Substrings in Random Strings
- Firas Swidan, Wednesday 5th July, 2006 Reconstructing Repeat-Annotated Phylogenetic Trees
- Subsequence Combinatorics and Applications Sven Rahmann
- Solving the Maximum Agreement Subtree and Maximum Compatible
- Statistical Encoding of Succinct Data Structures
- Dynamic Entropy-Compressed Sequences and Full-Text Indexes
- Algorithms for Finding a Most Similar Subforest
- Efficient Algorithms for Regular Expression Constrained
- Large Scale Matching for Position Weight Aude Liefooghe, Hel`ene Touzet and Jean-Stephane Varre
- Sharper Upper and Lower Bounds for an Approximation Scheme for
- Outline Introduction Worst-Case Optimal Search-Time Bounded Preprocessing Space Conclusion Text Indexing with Errors
- Introduction The median problem for the reversal distance in
- Reducing the size of NFAs by using equivalences and LUCIAN ILIE ROBERTO SOLIS-OBA SHENG YU
- Mass Spectra Alignments and their Significance
- Finding biclusters by random projections
- Maximum agreement and compatible supertrees VINCENT BERRY & FRANC OIS NICOLAS
- New results for the 2-interval pattern problem
- Introduction and biological background Definitions and examples
- Outline Introduction Related Work Main Results Basic Analysis Asymptotic Analysis Summary Average-Case Analysis of Approximate Trie Search
- Report on CPM 2003 14th Annual Symposium on Combinatorial Pattern Matching
- Distributed and Paged Suffix Trees for Large Genetic Databases
- Extracting Approximate Patterns Johann Pelfr^ene
- Efficient Selection of Unique and Popular Oligos for Large EST Databases
- CS141, Winter 2004 Project 3 Wheels! (optional extension)
- Two-Level Microprocessor-Accelerator Partitioning The integration of microprocessors and field-programmable gate
- Optimal Spaced Seeds for Hidden Markov Models, with Applications to Homologous Coding Regions
- An Improved Algorithm for the Macro-evolutionary Phylogeny Problem
- Error-Resilient LZW Data Compression Yonghui Wu Stefano Lonardi
- Compressed Text Indexes with Fast Locate Rodrigo Gonzalez1 and Gonzalo Navarro1
- #,#matching clifford@jesus.ox.ac.uk,
- TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL. X, NO. X, XXX XXXX 1 Accurate Construction of Consensus Genetic
- Succinct Representation of Separable Graphs
- BioMed Central Page 1 of 9
- Introduction Our Results
- A Linear-time Algorithm for Predicting Functional Annotations from Protein Protein Interaction Networks
- Text Indexing, Suffix Sorting & Data CompressionData Compression: Common Problems and Techniques
- Supplemental Material to: Nucleosome landscape and control of transcription in the human malaria
- Graphlet Kernels for Prediction of Functional Residues in Protein Structures
- A Practical Tool for Visualizing and Data Mining Medical Time Series Li Wei Nitin Kumar Venkata Lolla
- Firas Swidan, 5.7.2004 Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity Sorting by Length-Weighted Reversals
- Hidetoshi Yokoo Gunma University
- New Complexity Bounds for Image Matching under Rotation and Scaling
- Tiling Periodicity Juhani Karhumaki1
- BioMed Central Page 1 of 13
- Prefix-Free Regular-Expression , Yajun Wang and Derick Wood
- VizTree: a Tool for Visually Mining and Monitoring Massive Time Series Databases
- A compression-boosting transform for two-dimensional data
- max planck institut Faster Algorithms for Computing
- Introduction Improved FPT algorithm Induced Haplotyping Conclusion Extended Islands of Tractability for
- An Efficient Algorithm for Generating Super Condensed Neighborhoods
- Outline Introduction General HP Distance Summary HP Distance Via Double Cut and Join Distance
- Optimizing Restriction Site Placement for Synthetic Genomes
- Introduction Experiments
- Periodic string comparison Alexander Tiskin
- Introduction Parameterized Algorithms Parameterized Hardness Conclusion Parameterized Algorithms and Hardness Results
- Efficient and Accurate Construction of Genetic Linkage Maps from the Minimum Spanning Tree of a Graph
- 238 the plant genome november 2011 vol. 4, no. 3 original research
- Programming Project #2 Posted: October 28th, 2011
- Markov Models & Hidden Markov Models
- Intro to Molecular Biology (all you need to know ... in about 90 slides)
- String Matching in Hardware using the FM-Index Edward Fernandez, Walid Najjar and Stefano Lonardi
- Unique perfect phylogeny is NP-hard Michel Habib and Juraj Stacho
- Statistical Analysis of Sequences January 3, 2012
- counting colours in compressed strings Travis Gagie
- Opportunistic Data Structures with Applications Paolo Ferragina
- Indexing Structure for Sequences February 7, 2012
- Introduction Extensions of GRAPH MOTIF
- Forest alignment with affine gaps and anchors Stefanie Schirmer and Robert Giegerich
- Over the past four years, there has been a fundamental shift away from the application of automated Sanger
- On Wavelet Tree Construction German Tischler
- Frequent Submap Discovery Stphane GOSSELIN, Guillaume DAMIAND,
- Succincter text indexing with wildcards Chris Thachuk
- Discovering the Intrinsic Cardinality and Dimensionality of Time Series using MDL Bing Hu Thanawin Rakthanmanon Yuan Hao Scott Evans1
- Problem Definition and Motivation Existing solutions New fast algorithm Experimental Results Lempel-Ziv Factorization Revisited
- Approximation Algorithms for Orienting Mixed Graphs
- Discovering the Intrinsic Cardinality and Dimensionality of Time Series using MDL
- Molecular Biology Tools January 3, 2012
- Designing Seeds for Similarity Search in Genomic DNA Jeremy Buhler
- JOURNAL OF COMPUTATIONAL BIOLOGY Volume 7, Numbers 1/2, 2000
- Chromatin-driven de novo discovery of DNA binding motifs in the human malaria parasite
- Time Series Epenthesis: Clustering Time Series Streams Requires Ignoring Some Data Thanawin Rakthanmanon Eamonn J. Keogh Stefano Lonardi Scott Evans
- CS 234, Winter 2009 Midterm Name (first last) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
- Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts
- Phylogenetic Footprints and Consitent Sets of Local Alignments
- Tractability Results for the Consecutive-Ones Property with Multiplicity
- String Comparison & Lyndon-Like Factorization Using V-Order
- Efficient Seeds Computation Michalis Christou, Maxime Crochemore,
- nature biotechnology volume 26 number 10 oCTober 2008 1125 1Helicos BioSciences, One Kendall Square, Cambridge, Massachusetts 02139,
- Computational Methods for the Analysis of Biomecular Data
- Substring Range Reporting Philip Bille
- Polynomial-Time Approximation Algorithms for Weighted LCS Problem
- Biological Networks February 7, 2012
