8413 search results - page 214 / 1683 » Ordering Problem Subgoals |
120
click to vote
STRINGOLOGY
2004
15 years 3 months ago
2004
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
100
click to vote
ISMB
1997
15 years 3 months ago
1997
Anewheuristic algorithm is presented for mapping probes to locations along the genome,given noisy pairwise distance data as input. Themodel consideredis quite general: Theinput co...
WSC
1997
15 years 3 months ago
1997
For many companies the scheduling of job shops proves very difficult. Competing priorities (due dates, potential profit) from multiple customers confronts the plant manager with m...
121
click to vote
ALMOB
2006
15 years 2 months ago
2006
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
136
click to vote
IPM
2008
15 years 2 months ago
2008
Authorship analysis of electronic texts assists digital forensics and anti-terror investigation. Author identification can be seen as a single-label multi-class text categorizatio...