Sciweavers

1059 search results - page 22 / 212
» Discovering Sequence Similarity by the Algorithmic Significa...
Sort
View
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
14 years 29 days ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...
BMCBI
2006
137views more  BMCBI 2006»
13 years 8 months ago
Genome BLAST distance phylogenies inferred from whole plastid and whole mitochondrion genome sequences
Background: Phylogenetic methods which do not rely on multiple sequence alignments are important tools in inferring trees directly from completely sequenced genomes. Here, we exte...
Alexander F. Auch, Stefan R. Henz, Barbara R. Holl...
BMCBI
2007
164views more  BMCBI 2007»
13 years 8 months ago
SEARCHPATTOOL: a new method for mining the most specific frequent patterns for binding sites with application to prokaryotic DNA
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
Fathi Elloumi, Martha Nason
IADIS
2003
13 years 10 months ago
Query-Based Discovering of Popular Changes in WWW
This paper presents the method for retrieving and summarizing changes in topics from online resources. Users often want to know what are the major changes in their areas of intere...
Adam Jatowt, Khoo Khyou Bun, Mitsuru Ishizuka
BMCBI
2006
137views more  BMCBI 2006»
13 years 8 months ago
Chaos game representation for comparison of whole genomes
Background: Chaos game representation of genome sequences has been used for visual representation of genome sequence patterns as well as alignment-free comparisons of sequences ba...
Jijoy Joseph, Roschen Sasikumar