39,925 Hits in 2.2 sec

Optimal suffix selection

Gianni Franceschini, S. Muthukrishnan
2007 Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07  
GENERAL SELECTION ÁÒ Ø × × Ø ÓÒ Û ÔÖ × ÒØ Ò Ð ÓÖ Ø Ñ ÓÖ × Ð Ø Ò Ø kØ Ð Ü Ó Ö Ô ÐÐÝ ×Ñ ÐÐ ×Ø ×Ù Ü Ó S[1 · · · n] Ù× Ò O(n) ÓÑÔ Ö ×ÓÒ׺ 4.1 The Algorithm × ÓÖ Ø ×Ô Ð × Ó Ø Ð Ö ×Ø ×Ù Ü¸Ø Ð ÓÖ Ø Ñ ÓÖ × Ð Ø  ...  EXTREME SUFFIXES Ï ÔÖ × ÒØ Ò Ð ÓÖ Ø Ñ ÓÖ × Ð Ø Ò Ø Ð Ü Ó Ö Ô ÐÐÝ Ð Ö ×Ø ×Ù Ü Ó × ÕÙ Ò S[1 · · · n] Ù× Ò O(n) ÓÑÔ Ö ×ÓÒ× × Ð Ø Ò Ø ×Ñ ÐÐ ×Ø × × Ñ Ð Öº 3.1 The Algorithm Ì Ð ÓÖ Ø Ñ ÛÓÖ × Ò Ô × × Ø Ñ Ü ÑÙÑ  ...  UPDATING THE FORWARD SUFFIXES OF WINNERS AND LOSERS B.1.3 Queries and Updates  ... 
doi:10.1145/1250790.1250840 dblp:conf/stoc/FranceschiniM07 fatcat:amfar6gbzfg5tcmm6u27vxmo2q

Optimal cache-aware suffix selection [article]

Gianni Franceschini, Roberto Grossi, S. Muthukrishnan
2009 arXiv   pre-print
We present an optimal suffix selection algorithm in the cache-aware model, requiring N/B block transfers, for any string S over an unbounded alphabet (where characters can only be compared), under the  ...  Given string S[1..N] and integer k, the suffix selection problem is to determine the kth lexicographically smallest amongst the suffixes S[i... N], 1 ≤ i ≤ N.  ...  We present a suffix selection algorithm with optimal cache complexity.  ... 
arXiv:0902.1737v1 fatcat:s3qflatfyvfhrk7nv2tflbf5bi

Optimal Cache-Aware Suffix Selection

Gianni Franceschini, Roberto Grossi, S. Muthukrishnan, Marc Herbstritt
2009 Symposium on Theoretical Aspects of Computer Science  
We present an optimal suffix selection algorithm in the cache-aware model, requiring Θ (N/B) block transfers, for any string S over an unbounded alphabet (where characters can only be compared), under  ...  Given string S[1..N ] and integer k, the suffix selection problem is to determine the kth lexicographically smallest amongst the suffixes S[i . . . N ], 1 ≤ i ≤ N .  ...  We present a suffix selection algorithm with optimal cache complexity.  ... 
doi:10.4230/lipics.stacs.2009.1845 dblp:conf/stacs/FranceschiniGM09 fatcat:iq7duwvk7ngabgr3hax7pxo36y

Partial Data Compression and Text Indexing via Optimal Suffix Multi-Selection [article]

Gianni Franceschini and Roberto Grossi and S. Muthukrishnan
2011 arXiv   pre-print
This is asymptotically optimal, and also matches the bound in [Dobkin, Munro, JACM 28(3)] for multi-selection on atomic elements (not suffixes).  ...  The partial suffix problems as well as the suffix multi-selection problem have many applications.  ...  Optimal Algorithm for Multi-Selection of Suffixes Initialization stage. We begin by initializing the bookkeeping data structures described in Section 3.2.  ... 
arXiv:1110.3381v1 fatcat:etvgnztggzharehfynij3nhmee

Comparison Between Zero Point and Zero Suffix Methods in Fuzzy Transportation Problems

Pukky Tetralian Ngastiti, Bayu Surarso, Sutimin Sutimin
2020 Mantik: Jurnal Matematika  
The purpose of the research is a study of a comparison of theories from the zero-point method and the zero-suffix method in determining the optimal solution on cost transportation.  ...  For achieving the optimal value shows that for zero-suffix the method of occurrence iteration in the sixth step, but for the zero-point method the iteration occurs in the ninth step.  ...  Calculate the optimal solution using zero suffix method.  ... 
doi:10.15642/mantik.2020.6.1.38-46 fatcat:5sfrxhjvgrfenhpipb37tienqu


2005 Proceedings of the 3rd Asia-Pacific Bioinformatics Conference  
The system then return the optimal sequences to suspected viral infections to be automatically identified from database.  ...  A user can select any number of different viruses and set their experimental conditions. Including, for example, melting temperature, length of probe.  ...  tree (preselection) Tm (Optimal Selection) Tool N/A N/A virus sequences identification [5] Phage genome suffix array sequence landscape Web NO NO gene expression [6] General suffix  ... 
doi:10.1142/9781860947322_0031 fatcat:g3gwxua6tjhqxgpbavdgz6q5tu

Subject Index

2004 Journal of Discrete Algorithms  
array Replacing suffix trees with enhanced suffix arrays, 53 Suffix tree Replacing suffix trees with enhanced suffix arrays, 53 Synthetic distance Structural properties and tractability results  ...  doi:10.1016/S1570-8667(04)00076-0 Disk packing Packing two disks into a polygonal environment, 373 Distance selection problem Selecting distances in arrangements of hyper- planes spanned by points  ... 
doi:10.1016/s1570-8667(04)00076-0 fatcat:3igwdxr5pba53eev4y6a2jzgie

Solving Fuzzy Transportation Problem Using ASM Method and Zero Suffix Method

Aurora Nur Aini, Ali Shodiqin, Dewi Wulandari
2021 Enthusiastic : International Journal of Applied Statistics and Data Science  
The best solution for Fuzzy transportation problems with triangular sets using the ASM method was IDR 21,356,787.50, while the optimal solution using the Zero Suffix method was IDR 21,501,225.00.  ...  This article discusses the method to solve transportation problems without requiring an initial feasible solution using the ASM method and the Zero Suffix method.  ...  By performing these steps, we obtained the optimal allocation as follows: Finding the Optimal Solution of Fuzzy Transportation Problem using Zero Suffix Method Based on [8] and [6] , the first and  ... 
doi:10.20885/enthusiastic.vol1.iss1.art5 fatcat:rypyzchrqjd7jmgo2tk54k3ioy

Alphabet-Independent Compressed Text Indexing [chapter]

Djamal Belazzougui, Gonzalo Navarro
2011 Lecture Notes in Computer Science  
We obtain also some relevant byproducts on compressed suffix trees.  ...  Their time complexities are not optimal, however: they always depend on the alphabet size.  ...  While remarkable in terms of space, self-indexes have not retained the time complexities of the classical suffix trees and arrays. Table 1 lists the current space-optimal self-indexes.  ... 
doi:10.1007/978-3-642-23719-5_63 fatcat:igek3kgglzdtxjelbnj6gijnbm

Persian Morphosyntactic Features in Realization Optimality Theory

Fariba Ghatreh
2017 Zenodo  
in formal and informal varieties, hence separate tableaux with different rankings of constraints are sometimes needed in order to select the optimal candidates in each of those varieties.  ...  This article deals with the investigation of some morphosyntactic (inflectional) features of Modern Persian in Realization Optimality Theory, and shows among the other things that it is a better model  ...  The following tableau can show the situation for selecting the optimal candidate: 57. The order of suffixes in "xordim":We can also see the prefix ordering in Persian verbs as well.  ... 
doi:10.5281/zenodo.3339069 fatcat:iw6ih6fvjffzvpxekl3hfwlpxy

Algorithmic Approach for Solving Transportation Problems

A. Akilbasha, G. Natarajan, P. Pandian
2015 Global Journal of Pure and Applied Mathematics  
A new method called modified zero suffix method is proposed for finding an optimal solution for transportation problems in single stage. The solution procedure is given with numerical examples.  ...  As this method is very easy to understand and apply, it will help the managers in logistics related issues by aiding them in the decision making process and providing an optimal solution in a simple and  ...  This proposed Modified Zero Suffix Method helps the decision makers to select the best optimal solution. for all and areintegers,x i j Where m is the number of supply points; n is the number of demand  ... 
doi:10.37622/gjpam/11.5.2015.3743-3749 fatcat:2k4thld6vbcapnnuczasv6fiva

Improved count suffix trees for natural language data

Guido Sautter, Cristina Abba, Klemens Böhm
2008 Proceedings of the 2008 international symposium on Database engineering & applications - IDEAS '08  
Optimizing queries with predicates includes (sub)string estimation, i.e., estimating the selectivity of query terms based on small summary statistics before query execution.  ...  Existing pruning techniques are based on suffix frequency or tree depth.  ...  CONCLUSIONS Estimating the selectivity of query terms is essential for query optimization. For string predicates, estimation frequently relies on Count Suffix Trees (CST) [3, 6, 7] .  ... 
doi:10.1145/1451940.1451972 dblp:conf/ideas/SautterAB08 fatcat:qwfey72jkrd5peykukoznrud2i

Page 2848 of Mathematical Reviews Vol. , Issue 94e [page]

1994 Mathematical Reviews  
Summary: “Two deterministic selection algorithms on an n xn mesh-connected processor array are developed.  ...  It is a general selection algorithm, that is, its complexity bound does not depend on the rank of the ele- ment sought.  ... 

String matching with alphabet sampling

Francisco Claude, Gonzalo Navarro, Hannu Peltola, Leena Salmela, Jorma Tarhio
2012 Journal of Discrete Algorithms  
For indexed searching we achieve indexes that are as fast as the classical suffix array, yet occupy less than 50% extra space (instead of the usual 400%).  ...  Optimal sampling Suppose that we have enough space to create the sampled suffix array for b · n suffixes where 0 < b < 1.  ...  We index B for select B queries.  ... 
doi:10.1016/j.jda.2010.09.004 fatcat:bsdds272wjcsrldrjozoiigoeq

Alphabet-Independent Compressed Text Indexing

Djamal Belazzougui, Gonzalo Navarro
2014 ACM Transactions on Algorithms  
Their time complexities are not optimal, however; in particular they are always multiplied by a factor that depends on the alphabet size.  ...  In this paper we achieve, for the first time, full alphabet-independence in the time complexities of self-indexes, while retaining space optimality. We obtain also some relevant byproducts.  ...  It is open whether one can achieve optimal times within optimal space (say, under the H k (T ) entropy model).  ... 
doi:10.1145/2635816 fatcat:minh3t7w7rfuhce7ibeni65xtu
« Previous Showing results 1 — 15 out of 39,925 results