Sciweavers

47 search results - page 3 / 10
» Compressed Pattern Matching in DNA Sequences
Sort
View
WEA
2007
Springer
125views Algorithms» more  WEA 2007»
13 years 12 months ago
Simple Compression Code Supporting Random Access and Fast String Matching
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
Kimmo Fredriksson, Fedor Nikitin
CSB
2005
IEEE
132views Bioinformatics» more  CSB 2005»
13 years 7 months ago
A Fast Shotgun Assembly Heuristic
Genome sequencing opened a new era in genetics allowing the study of genomes at the nucleotide level. However, the chosen method of sequencing produced large numbers of nucleotide...
Christopher Wilks, Sami Khuri
BMCBI
2002
120views more  BMCBI 2002»
13 years 5 months ago
tacg - a grep for DNA
Background: Pattern matching is the core of bioinformatics; it is used in database searching, restriction enzyme mapping, and finding open reading frames. It is done repeatedly ov...
Harry Mangalam
APBC
2004
108views Bioinformatics» more  APBC 2004»
13 years 7 months ago
Ladderlike Stepping and Interval Jumping Searching Algorithms for DNA Sequences
In this study we have designed a novel algorithm for searching common segments in multiple DNA sequences. To improve efficiency in pattern searching, combination of hashing encodi...
Tun-Wen Pai, Margaret Dah-Tsyr Chang, Jia-Han Chu,...
ICIP
2010
IEEE
13 years 3 months ago
High quality scanned book compression using pattern matching
This paper proposes a hybrid approximate pattern matching/ transform-based compression engine. The idea is to use regular video interframe prediction as a pattern matching algorit...
Alexandre Zaghetto, Ricardo L. de Queiroz