scientific article; zbMATH DE number 1557065
From MaRDI portal
Publication:4526776
Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Algorithms in computer science (68W99) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to biology (92-01) Computational methods for problems pertaining to biology (92-08) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20)
Recommendations
- Algorithmic aspects of bioinformatics. Translated from the German original
- Algorithms in computational molecular biology. Techniques approaches and applications.
- scientific article; zbMATH DE number 1455130
- Introduction to computational biology. An evolutionary approach. With CD-ROM
- scientific article; zbMATH DE number 699389
Cited in
(only showing first 100 items - show all)- Algorithmic bioprocesses. Papers based on the presentations at the workshop, Leiden, The Netherland, December 2007. Dedicated to the 65th birthday of Grzegorz Rozenberg.
- Error graphs and the reconstruction of elements in groups
- Non-approximability of weighted multiple sequence alignment for arbitrary metrics
- A bibliography on computational molecular biology and genetics
- Combinatorics of periods in strings.
- Algorithmic complexity of protein identification: Combinatorics of weighted strings
- Bounds for parametric sequence comparison
- Gene assembly through cyclic graph decomposition
- A computer scientist's guide to molecular biology
- Lower bounds on the generalized central moments of the optimal alignments score of random sequences
- Sorting by reversals and the theory of 4-regular graphs
- Model of protein fragments and statistical potentials
- Lower bounds for moments of global scores of pairwise Markov chains
- On the kernelization complexity of string problems
- A very elementary presentation of the Hannenhalli-Pevzner theory
- Sorting signed permutations by reversals, revisited
- The restriction mapping problem revisited.
- Efficient algorithms for multichromosomal genome rearrangements.
- Finding hidden independent sets in interval graphs
- Computing the variance of tour costs over the solution space of the TSP in polynomial time
- Consensus string problem for multiple regular languages
- \(H\)-cycles in \(H\)-colored multigraphs
- Compatible spanning circuits in edge-colored graphs
- Almost Eulerian compatible spanning circuits in edge-colored graphs
- A greedy algorithm for the DNA sequencing by hybridization with positive and negative errors and information about repetitions
- On the computational complexity of closest genome problems
- Error-tolerant nonadaptive interval group testing with density-based tests
- Parameterized resiliency problems
- Some conditions for the existence of Euler H-trails
- The complexity of assigning genotypes to people in a pedigree consistently
- Sorting on graphs by adjacent swaps using permutation groups
- Paths and trails in edge-colored graphs
- Proper Hamiltonian cycles in edge-colored multigraphs
- New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs
- Threshold group testing with consecutive positives
- 3D-interval-filament graphs
- On reconstruction of signed permutations distorted by reversal errors
- Characterizing the reconstruction and enumerating the patterns of DNA sequences with re\-peats
- DNA fragment assembly using a grid-based genetic algorithm
- An all-substrings common subsequence algorithm
- 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.
- Clique-detection models in computational biochemistry and genomics
- On sorting by 3-bounded transpositions
- Multistage isothermic sequencing by hybridization
- Hardness results for the center and median string problems under the weighted and unweighted edit distances
- Expected length of the longest common subsequence for large alphabets
- A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation
- A central limit theorem for the length of the longest common subsequences in random words
- Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs
- A new dynamic programming algorithm for the simplified partial digest problem
- Moduli spaces and macromolecules
- Minimum weight feedback vertex sets in circle n-gon graphs and circle trapezoid graphs
- scientific article; zbMATH DE number 6488170 (Why is no real title available?)
- Edit-distance between visibly pushdown languages
- Cycles and paths in edge‐colored graphs with given degrees
- Algorithms in computational molecular biology. Techniques approaches and applications.
- Algorithms in bioinformatics. A practical introduction.
- String-matching and alignment algorithms for finding motifs in NGS data
- 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
- scientific article; zbMATH DE number 5162719 (Why is no real title available?)
- Pattern Recognition in Computational Molecular Biology
- On a speculated relation between Chvàtal-Sankoff constants of several sequences
- Genetic and tabu search algorithms for peptide assembly problem
- Inferring a graph from path frequency
- scientific article; zbMATH DE number 699389 (Why is no real title available?)
- The rate of the convergence of the mean score in random sequence comparison
- scientific article; zbMATH DE number 1154743 (Why is no real title available?)
- Genomic Perl
- Sufficient conditions for the existence of spanning colored trees in edge-colored graphs
- scientific article; zbMATH DE number 1455130 (Why is no real title available?)
- DNA-inspired information concealing: a survey
- Bayesian Phylogenetic Inference from Animal Mitochondrial Genome Arrangements
- Modeling recreational systems using optimization techniques and information technologies
- scientific article; zbMATH DE number 1860688 (Why is no real title available?)
- scientific article; zbMATH DE number 2118471 (Why is no real title available?)
- On the generalized constrained longest common subsequence problems
- scientific article; zbMATH DE number 1392340 (Why is no real title available?)
- The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles
- Kernelization of Whitney switches
- Constructing words with high distinct square densities
- On the flip graphs on perfect matchings of complete graphs and signed reversal graphs
- On computing centroids according to the p-norms of Hamming distance vectors
- Chinese postman problem on edge-colored multigraphs
- Interval group testing for consecutive positives
- Parameterized resiliency problems via integer linear programming
- APPROXIMATE BLOCK SORTING
- 2-Stage Fault Tolerant Interval Group Testing
- 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
- Introduction to computational biology. An evolutionary approach. With CD-ROM
- An improved genetic algorithm for problem of genome rearrangement
- The intractability of computing the Hamming distance
- Kernelization of Whitney Switches
- Some operations research methods for analyzing protein sequences and structures
- Comparative gene finding. Models, algorithms and implementation
- On the role of metaheuristic optimization in bioinformatics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4526776)
