Sciweavers

166 search results - page 11 / 34
» Suffix trees for very large genomic sequences
Sort
View
BMCBI
2010
126views more  BMCBI 2010»
14 years 12 months ago
Cgaln: fast and space-efficient whole-genome alignment
Background: Whole-genome sequence alignment is an essential process for extracting valuable information about the functions, evolution, and peculiarities of genomes under investig...
Ryuichiro Nakato, Osamu Gotoh
CSB
2005
IEEE
114views Bioinformatics» more  CSB 2005»
15 years 5 months ago
Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes
Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of effici...
Yinglei Song, Chunmei Liu, Russell L. Malmberg, Fa...
BMCBI
2007
120views more  BMCBI 2007»
14 years 11 months ago
Non-coding sequence retrieval system for comparative genomic analysis of gene regulatory elements
Background: Completion of the human genome sequence along with other species allows for greater understanding of the biochemical mechanisms and processes that govern healthy as we...
Sung Tae Doh, Yunyu Zhang, Matthew H. Temple, Li C...
ICPADS
2005
IEEE
15 years 5 months ago
Exploiting Multi-level Parallelism for Homology Search using General Purpose Processors
New biological experimental techniques are continuing to generate large amounts of data using DNA, RNA, human genome and protein sequences. The quantity and quality of data from t...
Xiandong Meng, Vipin Chaudhary
BMCBI
2006
107views more  BMCBI 2006»
14 years 11 months ago
Simplifying gene trees for easier comprehension
Background: In the genomic age, gene trees may contain large amounts of data making them hard to read and understand. Therefore, an automated simplification is important. Results:...
Paul-Ludwig Lott, Marvin Mundry, Christoph Sassenb...