scientific article; zbMATH DE number 699389

zbMath0831.92011MaRDI QIDQ4315008

Publication date: 4 December 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

solutions DNA sequences protein sequences molecular biology exercises clones RNA secondary structure common patterns clone maps evolutionary relationships restriction maps of DNA rough maps statistics of pattern counts

Mathematics Subject Classification ID

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)

Related Items

Study of LZ-word distribution and its application for sequence comparison, On the normal approximation for the distribution of the number of simple or compound patterns in a random sequence of multi-state trials, R\'enyi entropy and pattern matching for run-length encoded sequences, A Review of Statistical Methods for Genome Mapping, DNA2DNA computations: A potential “killer app”?, Simplicity in Eulerian circuits: uniqueness and safety, On the hardness of computing the edit distance of shallow trees, Why Greed Works for Shortest Common Superstring Problem, Investigating some attributes of periodicity in DNA sequences via semi-Markov modelling, Solving Partial Differential Equations on Manifolds From Incomplete Interpoint Distance, Folding Words Around Trees: Models Inspired by RNA, A new dynamic programming algorithm for the simplified partial digest problem, Rarity and exponentiality: an extension of Keilson's theorem, with applications, Large deviations-based upper bounds on the expected relative length of longest common subsequences, Stationary Probability Vectors of Higher-Order Two-Dimensional Symmetric Transition Probability Tensors, Genetic and Tabu search algorithms for peptide assembly problem, Some operations research methods for analyzing protein sequences and structures, A new algorithm for generation of different types of RNA, On a ‘Replicating Character String’ Model, On some stochastic models for replication of character strings, Computational complexity of isothermic DNA sequencing by hybridization, Randomized vs. deterministic distance query strategies for point location on the line, On the dispersion index of a Markovian molecular clock, Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem, Asymptotic Behavior of k-Word Matches Between two Uniformly Distributed Sequences, Bonferroni-type inequalities for conditional scan statistics, Counting, Generating, Analyzing and Sampling Tree Alignments, Moduli spaces and macromolecules, Statistical considerations underpinning an alignment-free sequence comparison method, Limit Theorems for the Inductive Mean on Metric Trees, An improved approximation for assessing the statistical significance of molecular sequence features, Analyzing Demographic Life Courses through Sequence Analysis, Chronological rank in biological evolution, Counting, Generating and Sampling Tree Alignments, Near optimal multiple alignment within a band in polynomial time, General combinatorics of RNA secondary structure, Distributed suffix trees, Forbidden Factors and Fragment Assembly, Compound Poisson approximation: A user's guide, The restriction mapping problem revisited., An entropy-based technique for classifying bacterial chromosomes according to synonymous codon usage, Fractional meanings of nonrepetitiveness, Parameterized enumeration, transversals, and imperfect phylogeny reconstruction, Avoiding cross-bifix-free binary words, All instantiations of the greedy algorithm for the shortest common superstring problem are equivalent, On the variance of the optimal alignments score for binary random words and an asymmetric scoring function, On the longest common increasing binary subsequence, Tabu search algorithm for DNA sequencing by hybridization with multiplicity information available, Duality between the local score of one sequence and constrained hidden Markov model, Two applications of the divide \(\&\) conquer principle in the molecular sciences, Local alignment of Markov chains, Lower bounds on the generalized central moments of the optimal alignments score of random sequences, Improving the divide-and-conquer approach to sum-of-pairs multiple sequence alignment, An efficient alignment algorithm for masked sequences, Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov--Jacobson energy model, Approximating dependent rare events, An optimization approach to the reconstruction of positional DNA sequencing by hybridization with errors, Topological classification and enumeration of RNA structures by genus, Comparison methods for branching and axillary flowering sequences, Numerical characteristics of word frequencies and their application to dissimilarity measure for sequence comparison, Versatile string kernels, RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties, Extraction of high quality \(k\)-words for alignment-free sequence comparison, Multiple sequence comparison -- a peptide matching approach, Optimal alignments of longest common subsequences and their path properties, Large deviation properties for patterns, The simplified partial digest problem: approximation and a graph-theoretic model, Complexity of DNA sequencing by hybridization., Extremes of Shepp statistics for Gaussian random walk, Exact distribution for the local score of a Markov chain, Symmetric time warping, Boltzmann pair probabilities and functional genomics, The rate of the convergence of the mean score in random sequence comparison, On the shortest distance between orbits and the longest common substring problem, Phylogenetic analysis of DNA sequences with a novel characteristic vector, A novel statistical measure for sequence comparison on the basis of \(k\)-word counts, Asymptotic number of hairpins of saturated RNA secondary structures, RNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm., Regular expression constrained sequence alignment, Textual data compression in computational biology: algorithmic techniques, Approximation of RNA multiple structural alignment, Graphical and numerical representations of DNA sequences: Statistical aspects of similarity, An optimization approach to multiple sequence alignment, Approximating the 2-interval pattern problem, Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches, Thermodynamical approach to the longest common subsequence problem, Multiple pattern matching: a Markov chain approach, Recognising online spatial activities using a bioinformatics inspired sequence alignment approach, Large deviations for random trees, Distribution of the length of the longest common subsequence of two multi-state biological sequences, On statistically meaningful geometric properties of digital three-dimensional structures of proteins, A topology for the space of protein chains and a notion of local statistical stability for their three-dimensional structures, Lower bounds for moments of global scores of pairwise Markov chains, Sparse long blocks and the micro-structure of the longuest common subsequences, Approximation to the mean curve in the LCS problem, Exact distribution of the local score for Markovian sequences, Asymptotic enumeration of RNA secondary structure, On the approximability of the simplified partial digest problem, Regression theory for categorical time series, Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern, Phylogenetic analysis of DNA sequences based on the generalized pseudo-amino acid composition, The full Steiner tree problem, Frequency of symbol occurrences in bicomponent stochastic models, Sequence comparison via polar coordinates representation and curve tree, Selected combinatorial problems of computational biology, Standard deviation of the longest common subsequence, Microscopic path structure of optimally aligned random sequences, Shortest distance between multiple orbits and generalized fractal dimensions, Elements related to the largest complete excursion of a reflected BM stopped at a fixed time. Application to local score, Empirical distribution of \(k\)-word matches in biological sequences, The number of standard and of effective multiple alignments, Classifying molecular sequences using a linkage graph with their pairwise similarities, Enhanced \(A^{*}\) algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases, Regularity of a dynamic neighborhood of a regular language, Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping, Combinatorics of RNA secondary structures, Evaluation of some DNA cloning strategies, Normalized Lempel-Ziv complexity and its application in bio-sequence analysis, Why greed works for shortest common superstring problem, Optimal string clustering based on a Laplace-like mixture and EM algorithm on a set of strings, Longest common substring for random subshifts of finite type, A novel method to accurately calculate statistical significance of local similarity analysis for high-throughput time series, Observation-driven generalized state space models for categorical time series, A technique to find multiple motif occurrences in a biomolecular sequence, Matching of observations of dynamical systems, with applications to sequence matching, Tabu search for DNA sequencing with false negatives and false positives, Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots, Euler circuits and DNA sequencing by hybridization, Partitioning single-molecule maps into multiple populations: Algorithms and probabilistic analysis, A unified approach to word occurrence probabilities, Fixed topology alignment with recombination, Approximate \(p\)-values for local sequence alignments., Motif statistics., Compact recognizers of episode sequences, Landscapes on spaces of trees, Point matching under non-uniform distortions., Compositional spectrum - revealing patterns for genomic sequence characterization and comparison, Evolutionary approaches to DNA sequencing with errors, Partial digest is hard to solve for erroneous input data