1215 search results - page 199 / 243 » Combinatorics |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
LATA
2010
Springer
15 years 26 days ago
2010
Springer
The problem of classifying all the avoidable binary patterns in words has been completely solved (see Chapter 3 of M. Lothaire, Algebraic Combinatorics on Words, Cambridge Universi...
112
click to vote
AB
2008
Springer
14 years 11 months ago
2008
Springer
In 2007, Eickmeyer et al. showed that the tree topologies outputted by the Neighbor-Joining (NJ) algorithm and the balanced minimum evolution (BME) method for phylogenetic reconstr...
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr´echet distance betwee...