Crochemore’s Partitioning on Weighted Strings and Applications-Reference-Cited by-同舟云学术

Crochemore’s Partitioning on Weighted Strings and Applications

Published:2017-01-27 Issue:2 Volume:80 Page:496-514
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Barton Carl^ORCID,Pissis Solon P.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/article/10.1007/s00453-016-0266-0/fulltext.html

Reference32 articles.

1. Alatabbi, A., Rahman, M.S., Smyth, W.F.: Computing covers using prefix tables. Dis. Appl. Math. 212, 2–9 (2016). doi: 10.1016/j.dam.2015.05.019

2. Amir, A., Chencinski, E., Iliopoulos, C.S., Kopelowitz, T., Zhang, H.: Property matching and weighted matching. Theor. Comput. Sci. 395(2–3), 298–310 (2008). doi: 10.1016/j.tcs.2008.01.006

3. Apostolico, A., Farach, M., Iliopoulos, C.S.: Optimal superprimitivity testing for strings. Inf. Process. Lett 39(1), 17–20 (1991)

4. Bannai, H., I, T., Inenaga, S., Nakashima, Y., Takeda, M., Tsuruta, K.: The “runs” theorem. arXiv:1406.0263v7 (2014). URL http://arxiv.org/abs/1406.0263

5. Barton, C., Iliopoulos, C., Pissis, S.: Optimal computation of all tandem repeats in a weighted sequence. Algorithms Mol. Biol. 9, (2014). doi: 10.1186/s13015-014-0021-5

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

1. On-line weighted pattern matching;Information and Computation;2019-06

2. Weighted Shortest Common Supersequence Problem Revisited;String Processing and Information Retrieval;2019

3. Efficient Computation of Palindromes in Sequences with Uncertainties*;Fundamenta Informaticae;2018-11-03

4. Efficient Computation of Palindromes in Sequences with Uncertainties;Engineering Applications of Neural Networks;2017