Sciweavers

873 search results - page 151 / 175
» Tournament scoring problem
Sort
View
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
15 years 1 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
ICDAR
1997
IEEE
15 years 1 months ago
Representing OCRed documents in HTML
ABSTRACT: OCR is an error-prone process. It is time-consuming and expensive to manually proofread OCR results. The errors remaining in OCRed texts can cause serious problems in rea...
Tao Hong, Sargur N. Srihari
BMCBI
2008
115views more  BMCBI 2008»
14 years 9 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...
83
Voted
JASIS
2010
262views more  JASIS 2010»
14 years 8 months ago
New event detection and topic tracking in Turkish
Topic detection and tracking (TDT) applications aim to organize the temporally ordered stories of a news stream according to the events. Two major problems in TDT are new event de...
Fazli Can, Seyit Kocberber, Ozgur Baglioglu, Suley...
CORR
2011
Springer
235views Education» more  CORR 2011»
14 years 4 months ago
On the accuracy of language trees
Historical linguistics aims at inferring the most likely language phylogenetic tree starting from information concerning the evolutionary relatedness of languages. The available i...
Simone Pompei, Vittorio Loreto, Francesca Tria