A5033294598- Algorithms and Data Compression
- Network Packet Processing and Optimization
- Natural Language Processing Techniques
- Genomics and Phylogenetic Studies
- Teaching and Learning Programming
- semigroups and automata theory
- Educational Games and Gamification
- DNA and Biological Computing
- Innovative Teaching and Learning Methods
- RNA and protein synthesis mechanisms
- Web Data Mining and Analysis
- Semantic Web and Ontologies
- Gene expression and cancer classification
- Spreadsheets and End-User Computing
- Intelligent Tutoring Systems and Adaptive Learning
- Music and Audio Processing
- Research in Social Sciences
- Advanced Database Systems and Queries
- Web Applications and Data Management
- Open Education and E-Learning
- Video Analysis and Summarization
- Wikis in Education and Collaboration
- Online Learning and Analytics
- Software Engineering Research
- Data Visualization and Analytics
Aalto University
2013-2024
University of Technology
2004-2011
Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier
2007
Institut de Génétique Humaine
2007
Université de Montpellier
2007
Centre National de la Recherche Scientifique
2007
University of Helsinki
1986-2005
Helsinki Institute for Information Technology
2003
University of Eastern Finland
1998-2000
Joensuu Science Park
1997-1998
Experimental comparisons of the running time approximate string matching algorithms for k differences problem are presented. Given a pattern string, text and an integer k, task is to find all occurrences in with at most (insertions, deletions, changes). We consider seven based on different approaches including dynamic programming, Boyer–Moore matching, suffix automata, distribution characters. It turns out that none best values parameters, speed between methods can be considerable.
An algorithm animation environment called Jeliot is presented. allows a Web user to visualize his/her own algorithms, written in Java, over the Internet. based on self-animation of data types: selects objects source code which he/she wants visualize, and produces automatically.
The Boyer–Moore idea applied in exact string matching is generalized to approximate matching. Two versions of the problem are considered. k mismatches find all occurrences a pattern (length m) text n) with at most mismatches. algorithm shown (under mild independence assumption) solve expected time $O(kn({1 / {(m - k) + ({k c})}}))$, where c size alphabet. A related developed for differences problem, task $ \leqslant k$ (insertions, deletions, changes). Experimental evaluation algorithms...
We present three algorithms for exact string matching of multiple patterns. Our are filtering methods, which apply q -grams and bit parallelism. ran extensive experiments with them compared various versions earlier algorithms, e.g., different trie implementations the Aho--Corasick algorithm. All our appeared to be substantially faster than solutions sets 1,000--10,000 patterns good performance two continues 100,000 The gain is because improved efficiency caused by -grams.
In a problem-based learning (PBL) environment, students work in groups on real-life problems and have the opportunity to determine for themselves what they need learn relevant subject area(s). A common feature of is provide with range resources that assist them solving problems. This paper attempts classify according educational functions activities which will be used. It also discusses communication patterns, assessment, evaluation respect learning. Finally, it presents two case studies,...
Ultra high-throughput sequencing is used to analyse the transcriptome or interactome at unprecedented depth on a genome-wide scale. These techniques yield short sequence reads that are then mapped genome predict putatively transcribed protein-interacting regions. We argue factors such as background distribution, errors, and read length impact prediction capacity of census experiments. Here we suggest computational approach measure these their influence both transcriptomic epigenomic assays....
The problem of order-preserving matching has gained attention lately. text and the pattern consist numbers. task is to find all substrings in which have same length relative order as pattern. applications analysis time series. We present a new sublinear solution based on filtration. Any algorithm for exact string can be used filtering method. If filtration sublinear, total method average. show by practical experiments that more efficient than earlier algorithms.
Searching for long DNA strings is studied. A q-gram variation of the Boyer–Moore algorithm considered. An alphabet transformation with precomputed tables utilized to reduce processing time. Experimental results show that new efficient in practice. © 1997 John Wiley & Sons, Ltd.