Author:
Amir Amihood,Chencinski Eran,Iliopoulos Costas,Kopelowitz Tsvi,Zhang Hui
Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. Lecture Notes in Computer Science;A. Amir,1999
2. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill (2001)
3. Farach, M., Muthukrishnan, S.: Perfect hashing for strings: Formalization and algorithms. In: Proc. 7th Combinatorial Pattern Matching Conference (CPM), pp. 130–140 (1996)
4. Iliopoulos, C.S., Mouchard, L., Perdikuri, K., Tsakalidis, A.: Computing the repetitions in a weighted sequence. In: Proceeding of the Prague Stringology Conference, pp. 91–98 (2003)
5. Thompson, J.D., Higgins, D.G., Gibson, T.J.: Clustal w: Improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Research 22, 4673–4680 (1994)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Space-Efficient Indexes for Uncertain Strings;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13
2. Linear-Time Computation of Prefix Table for Weighted Strings;Lecture Notes in Computer Science;2015
3. Similarity joins for uncertain strings;Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data;2014-06-18
4. Sparse and Truncated Suffix Trees on Variable-Length Codes;Combinatorial Pattern Matching;2011
5. Recent Advances in Weighted DNA Sequences;Algorithms in Computational Molecular Biology;2010-12-23