Sciweavers

166 search results - page 25 / 34
» Suffix trees for very large genomic sequences
Sort
View
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
15 years 4 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
BMCBI
2007
125views more  BMCBI 2007»
14 years 12 months ago
Statistical tests to compare motif count exceptionalities
Background: Finding over- or under-represented motifs in biological sequences is now a common task in genomics. Thanks to p-value calculation for motif counts, exceptional motifs ...
Stéphane Robin, Sophie Schbath, Vincent Van...
RECOMB
2006
Springer
16 years 1 days ago
Identifiability Issues in Phylogeny-Based Detection of Horizontal Gene Transfer
Prokaryotic organisms share genetic material across species boundaries by means of a process known as horizontal gene transfer (HGT). Detecting this process bears great significanc...
Cuong Than, Derek A. Ruths, Hideki Innan, Luay Nak...
86
Voted
COCOON
2009
Springer
15 years 6 months ago
Determination of Glycan Structure from Tandem Mass Spectra
Glycans are molecules made from simple sugars that form complex tree structures. Glycans constitute one of the most important protein modifications, and identification of glycans...
Sebastian Böcker, Birte Kehr, Florian Rasche
BMCBI
2006
116views more  BMCBI 2006»
14 years 11 months ago
MICA: desktop software for comprehensive searching of DNA databases
Background: Molecular biologists work with DNA databases that often include entire genomes. A common requirement is to search a DNA database to find exact matches for a nondegener...
William A. Stokes, Benjamin S. Glick