The following pages link to (Q4526776):
Displaying 50 items.
- The restriction mapping problem revisited. (Q1872722) (← links)
- Efficient algorithms for multichromosomal genome rearrangements. (Q1872727) (← links)
- Finding hidden independent sets in interval graphs (Q1884976) (← links)
- Computing the variance of tour costs over the solution space of the TSP in polynomial time (Q1935572) (← links)
- Consensus string problem for multiple regular languages (Q2042725) (← links)
- \(H\)-cycles in \(H\)-colored multigraphs (Q2117527) (← links)
- Compatible spanning circuits in edge-colored graphs (Q2182217) (← links)
- Almost Eulerian compatible spanning circuits in edge-colored graphs (Q2219966) (← links)
- A greedy algorithm for the DNA sequencing by hybridization with positive and negative errors and information about repetitions (Q2250888) (← links)
- On the computational complexity of closest genome problems (Q2295622) (← links)
- Error-tolerant nonadaptive interval group testing with density-based tests (Q2310744) (← links)
- Parameterized resiliency problems (Q2330129) (← links)
- Some conditions for the existence of Euler \(H\)-trails (Q2334082) (← links)
- The complexity of assigning genotypes to people in a pedigree consistently (Q2370452) (← links)
- Sorting on graphs by adjacent swaps using permutation groups (Q2374257) (← links)
- Paths and trails in edge-colored graphs (Q2378531) (← links)
- Proper Hamiltonian cycles in edge-colored multigraphs (Q2397532) (← links)
- New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs (Q2404619) (← links)
- Proper Hamiltonian paths in edge-colored multigraphs (Q2409503) (← links)
- Threshold group testing with consecutive positives (Q2449059) (← links)
- 3D-interval-filament graphs (Q2462403) (← links)
- On reconstruction of signed permutations distorted by reversal errors (Q2470469) (← links)
- Characterizing the reconstruction and enumerating the patterns of DNA sequences with re\-peats (Q2471049) (← links)
- DNA fragment assembly using a grid-based genetic algorithm (Q2475840) (← links)
- An all-substrings common subsequence algorithm (Q2482100) (← links)
- Computational complexity of isothermic DNA sequencing by hybridization (Q2489897) (← links)
- A simpler and faster 1.5-approximation algorithm for sorting by transpositions (Q2490115) (← links)
- Reducibility of gene patterns in ciliates using the breakpoint graph. (Q2490806) (← links)
- Clique-detection models in computational biochemistry and genomics (Q2491763) (← links)
- On sorting by 3-bounded transpositions (Q2497524) (← links)
- Multistage isothermic sequencing by hybridization (Q2500268) (← links)
- A phase transition in the random transposition random walk (Q2503162) (← links)
- Hardness results for the center and median string problems under the weighted and unweighted edit distances (Q2569417) (← links)
- Expected length of the longest common subsequence for large alphabets (Q2573406) (← links)
- A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation (Q2630342) (← links)
- A central limit theorem for the length of the longest common subsequences in random words (Q2679696) (← links)
- Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs (Q2687939) (← links)
- A new dynamic programming algorithm for the simplified partial digest problem (Q2697542) (← links)
- Moduli spaces and macromolecules (Q2797789) (← links)
- Minimum weight feedback vertex sets in circle \(n\)-gon graphs and circle trapezoid graphs (Q2890989) (← links)
- (Q2949558) (← links)
- Edit-Distance Between Visibly Pushdown Languages (Q2971150) (← links)
- Cycles and paths in edge‐colored graphs with given degrees (Q3055905) (← links)
- String-Matching and Alignment Algorithms for Finding Motifs in NGS Data (Q3305534) (← links)
- (Q3445961) (← links)
- Pattern Recognition in Computational Molecular Biology (Q3467816) (← links)
- On a Speculated Relation Between Chvátal–Sankoff Constants of Several Sequences (Q3552511) (← links)
- Genetic and Tabu search algorithms for peptide assembly problem (Q3561754) (← links)
- Bayesian Phylogenetic Inference from Animal Mitochondrial Genome Arrangements (Q4672153) (← links)
- (Q4827937) (← links)
