Linear Time Algorithms for Finding and Representing All the Tandem Repeats in a String

Journal of Computer and System Sciences - United States
doi 10.1016/j.jcss.2004.03.004
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Finding All Maximal Perfect Haplotype Blocks in Linear Time

Algorithms for Molecular Biology
Computational TheoryApplied MathematicsStructural BiologyMolecular BiologyMathematics
2020English

Linear Time Algorithms for Finding Articulation and Hinge Vertices of Circular Permutation Graphs

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2013English

Exact Exponential-Time Algorithms for Finding Bicliques

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
2010English

Tandem Repeats Discovery Service (TReaDS) Applied to Finding Novel Cis-Acting Factors in Repeat Expansion Diseases

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2012English

All Linear-Time Congruences for Familiar Operators

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Linear Time Algorithms for Clustering Problems in Any Dimensions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Finding and Characterizing Repeats in Plant Genomes

Methods in Molecular Biology
GeneticsMolecular Biology
2016English

Short Tandem Repeats in Human Exons: A Target for Disease Mutations

BMC Genomics
BiotechnologyGenetics
2008English

Finding Multiple Maximally Redundant Trees in Linear Time

Periodica Polytechnica Electrical Engineering
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy