The following pages link to (Q4526776):
Displaying 50 items.
- On the variance of the optimal alignments score for binary random words and an asymmetric scoring function (Q330635) (← links)
- Tabu search algorithm for DNA sequencing by hybridization with multiplicity information available (Q337001) (← links)
- Inferring a graph from path frequency (Q427879) (← links)
- The rate of the convergence of the mean score in random sequence comparison (Q433905) (← links)
- Sufficient conditions for the existence of spanning colored trees in edge-colored graphs (Q442397) (← links)
- DNA-inspired information concealing: a survey (Q465664) (← links)
- Modeling recreational systems using optimization techniques and information technologies (Q478052) (← links)
- On the generalized constrained longest common subsequence problems (Q491203) (← links)
- The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles (Q497683) (← links)
- Chinese postman problem on edge-colored multigraphs (Q516812) (← links)
- Interval group testing for consecutive positives (Q526226) (← links)
- The intractability of computing the Hamming distance (Q557834) (← links)
- The simplified partial digest problem: approximation and a graph-theoretic model (Q621677) (← links)
- Girth of pancake graphs (Q642997) (← links)
- An integer programming approach to DNA sequence assembly (Q647296) (← links)
- The `Butterfly effect' in Cayley graphs with applications to genomics. (Q694707) (← links)
- Uniquely decodable \(n\)-gram embeddings (Q706633) (← links)
- Selected combinatorial problems of computational biology (Q706944) (← links)
- Sequential importance sampling of binary sequences (Q746178) (← links)
- Nature-inspired novel Cuckoo search algorithm for genome sequence assembly (Q747671) (← links)
- Partial digest is hard to solve for erroneous input data (Q817811) (← links)
- Some algorithmic results for finding compatible spanning circuits in edge-colored graphs (Q830935) (← links)
- Statistics for phylogenetic trees (Q849456) (← links)
- Overlaps help: Improved bounds for group testing with interval queries (Q868385) (← links)
- An optimization approach to the reconstruction of positional DNA sequencing by hybridization with errors (Q879317) (← links)
- Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (Q891818) (← links)
- Multi-break rearrangements and chromosomal evolution (Q932316) (← links)
- Intersection representations of matrices by subtrees and unicycles on graphs (Q935839) (← links)
- The fibers and range of reduction graphs in ciliates (Q938298) (← links)
- Strategies of loop recombination in ciliates (Q944726) (← links)
- Comparing bacterial genomes from linear orders of patterns (Q947065) (← links)
- Some problems on Cayley graphs (Q952069) (← links)
- Minimum weight feedback vertex sets in circle graphs (Q963384) (← links)
- Links in edge-colored graphs (Q966157) (← links)
- On the approximability of the simplified partial digest problem (Q967421) (← links)
- Seeding strategies and recombination operators for solving the DNA fragment assembly problem (Q975413) (← links)
- Error graphs and the reconstruction of elements in groups (Q1024341) (← links)
- Non-approximability of weighted multiple sequence alignment for arbitrary metrics (Q1041795) (← links)
- Combinatorics of periods in strings. (Q1417950) (← links)
- Algorithmic complexity of protein identification: Combinatorics of weighted strings (Q1422404) (← links)
- Bounds for parametric sequence comparison (Q1602688) (← links)
- Gene assembly through cyclic graph decomposition (Q1605478) (← links)
- A computer scientist's guide to molecular biology (Q1606798) (← links)
- Lower bounds on the generalized central moments of the optimal alignments score of random sequences (Q1661578) (← links)
- Sorting by reversals and the theory of 4-regular graphs (Q1682854) (← links)
- Model of protein fragments and statistical potentials (Q1702095) (← links)
- Lower bounds for moments of global scores of pairwise Markov chains (Q1747794) (← links)
- On the kernelization complexity of string problems (Q1749539) (← links)
- A very elementary presentation of the Hannenhalli-Pevzner theory (Q1764894) (← links)
- Sorting signed permutations by reversals, revisited (Q1775771) (← links)
