scientific article; zbMATH DE number 1557065
From MaRDI portal
Publication:4526776
zbMath0972.92011MaRDI QIDQ4526776
Publication date: 28 January 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) Computational methods for problems pertaining to biology (92-08) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to biology (92-01) Algorithms in computer science (68W99)
Related Items (only showing first 100 items - show all)
APPROXIMATE BLOCK SORTING ⋮ On the role of metaheuristic optimization in bioinformatics ⋮ Parallel connectivity in edge-colored complete graphs: complexity results ⋮ Compatible spanning circuits and forbidden induced subgraphs ⋮ 2-Stage Fault Tolerant Interval Group Testing ⋮ Some operations research methods for analyzing protein sequences and structures ⋮ Macroscopic non-uniqueness and transversal fluctuation in optimal random sequence alignment ⋮ Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem ⋮ Paths and Trails in Edge-Colored Graphs ⋮ Linear-Time Recognition of Probe Interval Graphs ⋮ An improved genetic algorithm for problem of genome rearrangement ⋮ Kernelization of Whitney Switches ⋮ The restriction mapping problem revisited. ⋮ Efficient algorithms for multichromosomal genome rearrangements. ⋮ Parameterized Resiliency Problems via Integer Linear Programming ⋮ MINIMUM WEIGHT FEEDBACK VERTEX SETS IN CIRCLE n-GON GRAPHS AND CIRCLE TRAPEZOID GRAPHS ⋮ Some algorithmic results for finding compatible spanning circuits in edge-colored graphs ⋮ Finding hidden independent sets in interval graphs ⋮ The complexity of assigning genotypes to people in a pedigree consistently ⋮ Sorting on graphs by adjacent swaps using permutation groups ⋮ A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation ⋮ Paths and trails in edge-colored graphs ⋮ Statistics for phylogenetic trees ⋮ On the variance of the optimal alignments score for binary random words and an asymmetric scoring function ⋮ Tabu search algorithm for DNA sequencing by hybridization with multiplicity information available ⋮ Proper Hamiltonian cycles in edge-colored multigraphs ⋮ Lower bounds on the generalized central moments of the optimal alignments score of random sequences ⋮ Overlaps help: Improved bounds for group testing with interval queries ⋮ New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs ⋮ An optimization approach to the reconstruction of positional DNA sequencing by hybridization with errors ⋮ Proper Hamiltonian paths in edge-coloured multigraphs ⋮ Compatible spanning circuits in edge-colored graphs ⋮ Sorting by reversals and the theory of 4-regular graphs ⋮ Constructing Words with High Distinct Square Densities ⋮ Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs ⋮ Computing the variance of tour costs over the solution space of the TSP in polynomial time ⋮ A central limit theorem for the length of the longest common subsequences in random words ⋮ The simplified partial digest problem: approximation and a graph-theoretic model ⋮ On the flip graphs on perfect matchings of complete graphs and signed reversal graphs ⋮ Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs ⋮ Inferring a graph from path frequency ⋮ Model of protein fragments and statistical potentials ⋮ The rate of the convergence of the mean score in random sequence comparison ⋮ Edit-Distance Between Visibly Pushdown Languages ⋮ A new dynamic programming algorithm for the simplified partial digest problem ⋮ Sufficient conditions for the existence of spanning colored trees in edge-colored graphs ⋮ Girth of pancake graphs ⋮ Combinatorics of periods in strings. ⋮ An integer programming approach to DNA sequence assembly ⋮ Algorithmic complexity of protein identification: Combinatorics of weighted strings ⋮ DNA-inspired information concealing: a survey ⋮ Almost Eulerian compatible spanning circuits in edge-colored graphs ⋮ Threshold group testing with consecutive positives ⋮ Modeling recreational systems using optimization techniques and information technologies ⋮ Multi-break rearrangements and chromosomal evolution ⋮ Intersection representations of matrices by subtrees and unicycles on graphs ⋮ The fibers and range of reduction graphs in ciliates ⋮ On a Speculated Relation Between Chvátal–Sankoff Constants of Several Sequences ⋮ On the generalized constrained longest common subsequence problems ⋮ 3D-interval-filament graphs ⋮ String-Matching and Alignment Algorithms for Finding Motifs in NGS Data ⋮ The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles ⋮ Strategies of loop recombination in ciliates ⋮ Comparing bacterial genomes from linear orders of patterns ⋮ Genetic and Tabu search algorithms for peptide assembly problem ⋮ On reconstruction of signed permutations distorted by reversal errors ⋮ Lower bounds for moments of global scores of pairwise Markov chains ⋮ Characterizing the reconstruction and enumerating the patterns of DNA sequences with re\-peats ⋮ Some problems on Cayley graphs ⋮ On the kernelization complexity of string problems ⋮ Chinese postman problem on edge-colored multigraphs ⋮ DNA fragment assembly using a grid-based genetic algorithm ⋮ A greedy algorithm for the DNA sequencing by hybridization with positive and negative errors and information about repetitions ⋮ Interval group testing for consecutive positives ⋮ Minimum weight feedback vertex sets in circle graphs ⋮ The `Butterfly effect' in Cayley graphs with applications to genomics. ⋮ An all-substrings common subsequence algorithm ⋮ Links in edge-colored graphs ⋮ On the approximability of the simplified partial digest problem ⋮ A very elementary presentation of the Hannenhalli-Pevzner theory ⋮ Unnamed Item ⋮ Computational complexity of isothermic DNA sequencing by hybridization ⋮ A simpler and faster 1.5-approximation algorithm for sorting by transpositions ⋮ Reducibility of gene patterns in ciliates using the breakpoint graph. ⋮ Seeding strategies and recombination operators for solving the DNA fragment assembly problem ⋮ Uniquely decodable \(n\)-gram embeddings ⋮ Clique-detection models in computational biochemistry and genomics ⋮ Selected combinatorial problems of computational biology ⋮ Bayesian Phylogenetic Inference from Animal Mitochondrial Genome Arrangements ⋮ The intractability of computing the Hamming distance ⋮ Sorting signed permutations by reversals, revisited ⋮ On sorting by 3-bounded transpositions ⋮ Multistage isothermic sequencing by hybridization ⋮ Cycles and paths in edge‐colored graphs with given degrees ⋮ A phase transition in the random transposition random walk ⋮ Moduli spaces and macromolecules ⋮ Consensus string problem for multiple regular languages ⋮ On the computational complexity of closest genome problems ⋮ Sequential importance sampling of binary sequences ⋮ Nature-inspired novel Cuckoo search algorithm for genome sequence assembly
This page was built for publication:
