41 citations · 92 across the 4 of their papers we have counts for
4 papers
Mean-Field Approximations to the Longest Common Subsequence Problem
J. Boutet de Monvel
The Longest Common Subsequence (LCS) problem is a fundamental problem of sequence comparison. A natural approximation to this problem is a model in which every pairs of letters of…
Extensive Simulations for Longest Common Subsequences: Finite Size Scaling, a Cavity Solution, and Configuration Space properties
J. Boutet de Monvel
The Longest Common Subsequence (LCS) Problem asks for the longest sequence of (non-contiguous) matches between two given strings of characters. Using extensive Monte Carlo simulati…
Comparing Mean Field and Euclidean Matching Problems
J. Houdayer, J. H. Boutet de Monvel, O. C. Martin
Combinatorial optimization is a fertile testing ground for statistical physics methods developed in the context of disordered systems, allowing one to confront theoretical mean fie…
Mean field and corrections for the Euclidean Minimum Matching problem
Jacques Boutet de Monvel, Olivier C. Martin
Consider the length of the minimum matching of N points in d-dimensional Euclidean space. Using numerical simulations and the finite size scaling law $< L_{MM}^E > = β_{…