An Algorithm for Approximate Tandem Repeats-Reference-Cited by-同舟云学术

An Algorithm for Approximate Tandem Repeats

Published:2001-02 Issue:1 Volume:8 Page:1-18
ISSN:1066-5277
Container-title:Journal of Computational Biology
language:en
Short-container-title:Journal of Computational Biology

Author:

Landau Gad M.¹,Schmidt Jeanette P.²,Sokol Dina³

Affiliation:

1. Department of Computer Science, Haifa University, Haifa 31905, Israel; Department of Computer and Information Science, Polytechnic University, Six MetroTech Center, Brooklyn, NY 11201-3840.

2. Incyte Pharmaceuticals, 3174 Porter Drive, Palo Alto, CA 94304.

3. Department of Computer Science, Bar-Ilan University, Ramat Gan 52900, Israel.

Publisher

Mary Ann Liebert Inc

Subject

Computational Theory and Mathematics,Computational Mathematics,Genetics,Molecular Biology,Modeling and Simulation

Link

http://www.liebertpub.com/doi/pdf/10.1089/106652701300099038

Reference22 articles.

1. Optimal parallel detection of squares in strings

2. A space efficient algorithm for finding the best nonoverlapping alignment score

3. Sequence Alignment with Tandem Duplication

4. Tandem repeats finder: a program to analyze DNA sequences

5. On the Distribution of K-tuple Matches for Sequence Homology: A Constant Time Exact Calculation of the Variance

Cited by 116 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Duplication-Free Codes for Disjoint or Equal-Length Errors;2024-01-17

2. RPTRF: A rapid perfect tandem repeat finder tool for DNA sequences;Biosystems;2023-04

3. New Approaches for String Site-Removal Problem;Procedia Computer Science;2023

4. Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem;String Processing and Information Retrieval;2023

5. Exact and Inexact Search for 2d Side-Sharing Tandems;2023