Struct fibertools_rs::cli::AddNucleosomeOptions
source · pub struct AddNucleosomeOptions {
pub bam: String,
pub out: String,
pub nucleosome_length: i64,
pub combined_nucleosome_length: i64,
pub min_distance_added: i64,
pub distance_from_end: i64,
pub allowed_m6a_skips: i64,
pub min_ml_score: u8,
}Fields§
§bam: StringBam HiFi file with m6A calls
out: StringOutput bam file with nucleosome calls
nucleosome_length: i64Minium nucleosome length
combined_nucleosome_length: i64Minium nucleosome length when combining over a single m6A
min_distance_added: i64Minium distance needed to add to an already existing nuc by crossing an m6a
distance_from_end: i64Minimum distance from the end of a fiber to call a nucleosome or MSP
allowed_m6a_skips: i64Most m6A events we can skip over to get to the nucleosome length when using D-segment algorithm. 2 is often a good value, negative values disable D-segment for the simple caller.
min_ml_score: u8Minium score in the ML tag to use in predicting nucleosomes
Implementations§
source§impl AddNucleosomeOptions
impl AddNucleosomeOptions
pub fn default_value() -> Self
Trait Implementations§
source§impl Args for AddNucleosomeOptions
impl Args for AddNucleosomeOptions
source§fn group_id() -> Option<Id>
fn group_id() -> Option<Id>
Report the [
ArgGroup::id][crate::ArgGroup::id] for this set of argumentssource§fn augment_args<'b>(__clap_app: Command) -> Command
fn augment_args<'b>(__clap_app: Command) -> Command
source§fn augment_args_for_update<'b>(__clap_app: Command) -> Command
fn augment_args_for_update<'b>(__clap_app: Command) -> Command
source§impl Debug for AddNucleosomeOptions
impl Debug for AddNucleosomeOptions
source§impl FromArgMatches for AddNucleosomeOptions
impl FromArgMatches for AddNucleosomeOptions
source§fn from_arg_matches(__clap_arg_matches: &ArgMatches) -> Result<Self, Error>
fn from_arg_matches(__clap_arg_matches: &ArgMatches) -> Result<Self, Error>
source§fn from_arg_matches_mut(
__clap_arg_matches: &mut ArgMatches
) -> Result<Self, Error>
fn from_arg_matches_mut( __clap_arg_matches: &mut ArgMatches ) -> Result<Self, Error>
source§fn update_from_arg_matches(
&mut self,
__clap_arg_matches: &ArgMatches
) -> Result<(), Error>
fn update_from_arg_matches( &mut self, __clap_arg_matches: &ArgMatches ) -> Result<(), Error>
Assign values from
ArgMatches to self.source§fn update_from_arg_matches_mut(
&mut self,
__clap_arg_matches: &mut ArgMatches
) -> Result<(), Error>
fn update_from_arg_matches_mut( &mut self, __clap_arg_matches: &mut ArgMatches ) -> Result<(), Error>
Assign values from
ArgMatches to self.Auto Trait Implementations§
impl RefUnwindSafe for AddNucleosomeOptions
impl Send for AddNucleosomeOptions
impl Sync for AddNucleosomeOptions
impl Unpin for AddNucleosomeOptions
impl UnwindSafe for AddNucleosomeOptions
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<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.