Sciweavers

178 search results - page 5 / 36
» An improved string composition method for sequence compariso...
Sort
View
CONSTRAINTS
2000
96views more  CONSTRAINTS 2000»
13 years 7 months ago
A Comparison of Traditional and Constraint-based Heuristic Methods on Vehicle Routing Problems with Side Constraints
The vehicle routing problem (VRP) is a variant of the familiar travelling salesperson problem (TSP). In the VRP we are to perform a number of visits, using a number of vehicles of ...
Philip Kilby, Patrick Prosser, Paul Shaw
BMCBI
2008
114views more  BMCBI 2008»
13 years 8 months ago
Identifying a few foot-and-mouth disease virus signature nucleotide strings for computational genotyping
Background: Serotypes of the Foot-and-Mouth disease viruses (FMDVs) were generally determined by biological experiments. The computational genotyping is not well studied even with...
Guohui Lin, Zhipeng Cai, Junfeng Wu, Xiu-Feng Wan,...
BMCBI
2008
101views more  BMCBI 2008»
13 years 8 months ago
Reranking candidate gene models with cross-species comparison for improved gene prediction
Background: Most gene finders score candidate gene models with state-based methods, typically HMMs, by combining local properties (coding potential, splice donor and acceptor patt...
Qian Liu, Koby Crammer, Fernando C. N. Pereira, Da...
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
14 years 4 days ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
FUIN
2006
98views more  FUIN 2006»
13 years 8 months ago
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Kimmo Fredriksson