For any m strings of total length n, we propose an O(mn log n)-time, O(n)-space algorithm that finds a maximal common subsequence all the strings, in sense inserting character it no longer yields them. Such could be treated as indicating nontrivial structure find since is NP-hard to longest strings.

A bstract We construct a cohomogeneity-1 helical black string in six-dimensional Einstein gravity. The solution branches from the onset of gravitational superradiant instability equal-spinning Myers-Perry string. isometry group is ℝ T × U(1) Z SU(2), where first two are isometries generated by linear combinations time translation, shifts along string, and rotation, each which individually broke...

The expected number of 0-1 strings of a limited length is a potentially useful index of the behavior of stochastic processes describing the occurrence of critical events (e.g., records, extremes, and exceedances). Such model sequences might be derived by a HoppePolya or a Polya-Eggenberger urnmodel interpreting the drawings of white balls as occurrences of critical events. Numerical results, co...