pub enum DecoyMethod {
Shuffle,
Reverse,
RandomUniform,
RandomFreq,
Markov {
order: usize,
},
DeBruijn {
k: usize,
},
DeBruijnCleave {
k: usize,
},
}Expand description
Decoy generation method, parsed from the decoy_method config string.
Variants§
Shuffle
Peptide-interior shuffle (handled in database.rs, not here).
Reverse
RandomUniform
RandomFreq
Markov
DeBruijn
DeBruijnCleave
Cleavage-site-preserving de Bruijn: K/R/P stay at their exact positions (so the tryptic peptide lengths/count match the target exactly), and the remaining positions are filled by a back-off Markov walk (orders k..1..0) over real sequence — every residue drawn from real high-order context, no abrupt restarts. The most realistic decoy that still isn’t a plain reversal.
Implementations§
Source§impl DecoyMethod
impl DecoyMethod
Sourcepub fn parse(name: &str, order: usize) -> DecoyMethod
pub fn parse(name: &str, order: usize) -> DecoyMethod
Parse decoy_method + decoy_order from config. Unknown → Shuffle.
pub fn is_protein_level(&self) -> bool
Trait Implementations§
Source§impl Clone for DecoyMethod
impl Clone for DecoyMethod
impl Copy for DecoyMethod
Source§impl Debug for DecoyMethod
impl Debug for DecoyMethod
impl Eq for DecoyMethod
Source§impl PartialEq for DecoyMethod
impl PartialEq for DecoyMethod
impl StructuralPartialEq for DecoyMethod
Auto Trait Implementations§
impl Freeze for DecoyMethod
impl RefUnwindSafe for DecoyMethod
impl Send for DecoyMethod
impl Sync for DecoyMethod
impl Unpin for DecoyMethod
impl UnsafeUnpin for DecoyMethod
impl UnwindSafe for DecoyMethod
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
impl<T> Scalar for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.