Sciweavers

166 search results - page 4 / 34
» Suffix trees for very large genomic sequences
Sort
View
BIRD
2008
Springer
177views Bioinformatics» more  BIRD 2008»
13 years 10 months ago
Fast Structured Motif Search in DNA Sequences
We study the problem of structured motif search in DNA sequences. This is a fundamental task in bioinformatics which contributes to better understanding of genome characteristics a...
Mihail Halachev, Nematollaah Shiri
BMCBI
2008
128views more  BMCBI 2008»
13 years 8 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich
BMCBI
2010
135views more  BMCBI 2010»
13 years 8 months ago
GIGA: a simple, efficient algorithm for gene tree inference in the genomic age
Background: Phylogenetic relationships between genes are not only of theoretical interest: they enable us to learn about human genes through the experimental work on their relativ...
Paul D. Thomas
BMCBI
2011
13 years 3 days ago
PhyloMap: an algorithm for visualizing relationships of large sequence data sets and its application to the influenza A virus ge
Background: Results of phylogenetic analysis are often visualized as phylogenetic trees. Such a tree can typically only include up to a few hundred sequences. When more than a few...
Jiajie Zhang, Amir Madany Mamlouk, Thomas Martinet...
SIGMOD
2005
ACM
178views Database» more  SIGMOD 2005»
14 years 8 months ago
Towards Effective Indexing for Very Large Video Sequence Database
With rapid advances in video processing technologies and ever fast increments in network bandwidth, the popularity of video content publishing and sharing has made similarity sear...
Heng Tao Shen, Beng Chin Ooi, Xiaofang Zhou