Struct ClosestSubstring 

pub struct ClosestSubstring { /* private fields */ }

The Closest Substring problem.

Given a finite alphabet Sigma = {0, ..., q - 1}, n input strings s_1, ..., s_n over Sigma (not necessarily of equal length), and a window length ell with ell <= |s_i| for every i, find a center c in Sigma^ell and per-string window start positions p_i in {0, ..., W_i - 1} (where W_i = |s_i| - ell + 1) minimizing

max_{1 <= i <= n} d_H(c, s_i[p_i .. p_i + ell)),

where d_H is the Hamming distance. Every choice in the discrete cube is syntactically feasible.

Implementations

impl ClosestSubstring

pub fn new( alphabet_size: usize, strings: Vec<Vec<usize>>, substring_length: usize, ) -> Self

Create a new ClosestSubstring instance.

Panics

Panics if:

• strings is empty (the problem requires at least one input string),
• substring_length > |s_i| for any input string,
• alphabet_size == 0 while substring_length > 0,
• any symbol in any input string is >= alphabet_size.

pub fn alphabet_size(&self) -> usize

Returns the alphabet size q.

pub fn strings(&self) -> &[Vec<usize>]

Returns the input strings.

pub fn num_strings(&self) -> usize

Returns the number of input strings n.

pub fn substring_length(&self) -> usize

Returns the common window length ell.

pub fn total_length(&self) -> usize

Returns the sum of input string lengths.

pub fn total_num_windows(&self) -> usize

Returns sum_i W_i, where W_i = |s_i| - substring_length + 1.

pub fn num_window_choice_product(&self) -> usize

Returns prod_i W_i, the number of distinct window-selection tuples.

Uses saturating multiplication so the value cannot overflow; callers should treat a return of usize::MAX as “very large”.

Trait Implementations

impl Clone for ClosestSubstring

fn clone(&self) -> ClosestSubstring

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for ClosestSubstring

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for ClosestSubstring

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Problem for ClosestSubstring

const NAME: &'static str = "ClosestSubstring"

Base name of this problem type (e.g., “MaximumIndependentSet”).

type Value = Min<i64>

The evaluation value type.

fn variant() -> Vec<(&'static str, &'static str)>

Returns variant attributes derived from type parameters.

fn dims(&self) -> Vec<usize>

Configuration space dimensions. Each entry is the cardinality of that variable.

fn evaluate(&self, config: &[usize]) -> Min<i64>

Evaluate the problem on a configuration.

fn num_variables(&self) -> usize

Number of variables (derived from dims).

fn problem_type() -> ProblemType

Look up this problem’s catalog entry.

impl ReduceTo<ILP<i32>> for ClosestSubstring

type Result = ReductionClosestSubstringToILP

The reduction result type.

fn reduce_to(&self) -> Self::Result

Reduce this problem to the target problem type.

impl Serialize for ClosestSubstring

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl DeclaredVariant for ClosestSubstring