Sciweavers

570 search results - page 83 / 114
» On the number of zero-sum subsequences
Sort
View
BMCBI
2007
154views more  BMCBI 2007»
13 years 10 months ago
Cinteny: flexible analysis and visualization of synteny and genome rearrangements in multiple organisms
Background: Identifying syntenic regions, i.e., blocks of genes or other markers with evolutionary conserved order, and quantifying evolutionary relatedness between genomes in ter...
Amit U. Sinha, Jaroslaw Meller
BMCBI
2008
133views more  BMCBI 2008»
13 years 10 months ago
MS-DOCK: Accurate multiple conformation generator and rigid docking protocol for multi-step virtual ligand screening
Background: The number of protein targets with a known or predicted tri-dimensional structure and of drug-like chemical compounds is growing rapidly and so is the need for new the...
Nicolas Sauton, David Lagorce, Bruno O. Villoutrei...
BMCBI
2007
123views more  BMCBI 2007»
13 years 10 months ago
Tracembler - software for in-silico chromosome walking in unassembled genomes
Background: Whole genome shotgun sequencing produces increasingly higher coverage of a genome with random sequence reads. Progressive whole genome assembly and eventual finishing ...
Qunfeng Dong, Matthew D. Wilkerson, Volker Brendel
BMCBI
2008
75views more  BMCBI 2008»
13 years 10 months ago
Re-searcher: a system for recurrent detection of homologous protein sequences
Background: Sequence searches are routinely employed to detect and annotate related proteins. However, a rapid growth of databases necessitates a frequent repetition of sequence s...
Valdemaras Repsys, Mindaugas Margelevicius, Ceslov...
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 10 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh