Sciweavers

612 search results - page 72 / 123
» Sequence Database Search Using Jumping Alignments
Sort
View
ICDE
2007
IEEE
190views Database» more  ICDE 2007»
15 years 7 months ago
CPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequences
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...
Swee-Seong Wong, Wing-Kin Sung, Limsoon Wong
BMCBI
2006
103views more  BMCBI 2006»
15 years 3 months ago
Cis-motifs upstream of the transcription and translation initiation sites are effectively revealed by their positional disequili
Background: The discovery of cis-regulatory motifs still remains a challenging task even though the number of sequenced genomes is constantly growing. Computational analyses using...
Kenneth W. Berendzen, Kurt Stüber, Klaus Hart...
BMCBI
2008
115views more  BMCBI 2008»
15 years 3 months ago
PARPST: a PARallel algorithm to find peptide sequence tags
Background: Protein identification is one of the most challenging problems in proteomics. Tandem mass spectrometry provides an important tool to handle the protein identification ...
Sara Brunetti, Elena Lodi, Elisa Mori, Maria Stell...
NAR
2007
127views more  NAR 2007»
15 years 2 months ago
The Universal Protein Resource (UniProt)
The Universal Protein Resource (UniProt) provides the scientific community with a single, centralized, authoritative resource for protein sequences and functional information. For...
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
15 years 7 months ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom