Sciweavers

85 search results - page 13 / 17
» Comparison of Exact String Matching Algorithms for Biologica...
Sort
View
CSB
2005
IEEE
132views Bioinformatics» more  CSB 2005»
13 years 9 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
2008
123views more  BMCBI 2008»
13 years 7 months ago
PocketMatch: A new algorithm to compare binding sites in protein structures
Background: Recognizing similarities and deriving relationships among protein molecules is a fundamental requirement in present-day biology. Similarities can be present at various...
Kalidas Yeturu, Nagasuma Chandra
CORR
2007
Springer
81views Education» more  CORR 2007»
13 years 7 months ago
Faster exon assembly by sparse spliced alignment
Assembling a gene from candidate exons is an important problem in computational biology. Among the most successful approaches to this problem is spliced alignment, proposed by Gelf...
Alexandre Tiskin
RECOMB
2002
Springer
14 years 7 months ago
Provably sensitive Indexing strategies for biosequence similarity search
The field of algorithms for pairwisc biosequence similarity search is dominated by heuristic methods of high efficiency but uncertain sensitivity. One reason that more formal stri...
Jeremy Buhler
CSR
2006
Springer
13 years 11 months ago
Fast Motif Search in Protein Sequence Databases
Regular expression pattern matching is widely used in computational biology. Searching through a database of sequences for a motif (a simple regular expression), or its variations...
Elena Zheleva, Abdullah N. Arslan