Upper Bounds to Genome Rearrangement Problem using Prefix Transpositions.
Pramod P. NairPublished in: CoRR (2022)
Keyphrases
- upper bound
- lower bound
- data structure
- upper and lower bounds
- lower and upper bounds
- branch and bound algorithm
- tight bounds
- human genome
- worst case
- sequence data
- branch and bound
- generalization error
- upper bounding
- phylogenetic analysis
- sequence analysis
- tight upper and lower bounds
- sample size
- vc dimension
- tree structure
- genomic sequences
- metabolic pathways
- prefix tree
- escherichia coli
- sample complexity