Search results for "supersequence"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
136	Zdenek Tronícek	Problems Related to Subsequences and Supersequences.	SPIRE/CRIWG	1999	DBLP DOI BibTeX RDF	supersequence, Directed Acyclic Supersequence Graph, seaching subsequences, subsequence
66	Jirí Kubalík	Efficient stochastic local search algorithm for solving the shortest common supersequence problem.	GECCO	2010	DBLP DOI BibTeX RDF	evolutionary algorithms, combinatorial optimization, stochastic local search
66	Ambrose Kofi Laing, Robert Cypher, Christian A. Duncan	On the Flattest Common Supersequence Method for Deadlock-Free Routing in Arbitrary Networks.	Theory Comput. Syst.	2000	DBLP DOI BibTeX RDF
59	Randeep Bhatia, Samir Khuller, Joseph Naor	The Loading Time Scheduling Problem (Extended Abstract).	FOCS	1995	DBLP DOI BibTeX RDF	loading time scheduling problem, precedence constrained scheduling problems, numerically controlled machines, shortest common supersequence problem, algorithmic technique, weighted shortest common supersequence problem, scheduling, databases, artificial intelligence, artificial intelligence, code generation, query optimization, parallel machines, parallel machines, constraint handling, machining
47	Zvi Gotthilf, Moshe Lewenstein	Improved Approximation Results on the Shortest Common Supersequence Problem.	SPIRE	2009	DBLP DOI BibTeX RDF
47	Christian Blum 0001, Carlos Cotta, Antonio J. Fernández 0001, José E. Gallardo	A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem.	EvoCOP	2007	DBLP DOI BibTeX RDF
47	Kang Ning 0001, Hon Wai Leong	Towards a Better Solution to the Shortest Common Supersequence Problem: A Post.	IMSCCS (1)	2006	DBLP DOI BibTeX RDF
47	Carlos Cotta	Memetic Algorithms with Partial Lamarckism for the Shortest Common Supersequence Problem.	IWINAC (2)	2005	DBLP DOI BibTeX RDF
47	Carlos Cotta	A Comparison of Evolutionary Approaches to the Shortest Common Supersequence Problem.	IWANN	2005	DBLP DOI BibTeX RDF
47	René Michel, Martin Middendorf	An Island Model Based Ant System with Lookahead for the Shortest Supersequence Problem.	PPSN	1998	DBLP DOI BibTeX RDF
38	Warren Cheung, William S. Evans, Jeremy Moses	Predicated Instructions for Code Compaction.	SCOPES	2003	DBLP DOI BibTeX RDF
38	Michael R. Fellows, Michael T. Hallett, Chantal Korostensky, Ulrike Stege	Analogs and Duals of the MAST Problem for Sequences and Trees.	ESA	1998	DBLP DOI BibTeX RDF
28	Oliver Tan	Skip Letters for Short Supersequence of All Permutations.	CoRR	2022	DBLP BibTeX RDF
28	Fei Luo 0002, Cheng Chen, Joel Fuentes, Yong Li, Weichao Ding	An Opposition-Based Learning CRO Algorithm for Solving the Shortest Common Supersequence Problem.	Entropy	2022	DBLP DOI BibTeX RDF
28	Oliver Tan	Skip letters for short supersequence of all permutations.	Discret. Math.	2022	DBLP DOI BibTeX RDF
28	Jonas Mayerhofer, Markus Kirchweger, Marc Huber, Günther R. Raidl	A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation.	EvoCOP	2022	DBLP DOI BibTeX RDF
28	Mahsa Ziraksima, Shahriar Lotfi, Habib Izadkhah	Using an evolutionary approach based on shortest common supersequence problem for loop fusion.	Soft Comput.	2020	DBLP DOI BibTeX RDF
28	Fei Luo 0002, Cheng Chen, Joel Fuentes	An improved chemical reaction optimization algorithm for solving the shortest common supersequence problem.	Comput. Biol. Chem.	2020	DBLP DOI BibTeX RDF
28	Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba	Weighted Shortest Common Supersequence Problem Revisited.	CoRR	2019	DBLP BibTeX RDF
28	Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba	Weighted Shortest Common Supersequence Problem Revisited.	SPIRE	2019	DBLP DOI BibTeX RDF
28	C. M. Khaled Saifullah, Md. Rafiqul Islam 0002	Chemical reaction optimization for solving shortest common supersequence problem.	Comput. Biol. Chem.	2016	DBLP DOI BibTeX RDF
28	Przemyslaw Uznanski	All Permutations Supersequence is coNP-complete.	CoRR	2015	DBLP BibTeX RDF
28	Ankush Garg, Deepak Garg 0002	Progressive alignment using Shortest Common Supersequence.	ICACCI	2014	DBLP DOI BibTeX RDF
28	Riccardo Dondi	The constrained shortest common supersequence problem.	J. Discrete Algorithms	2013	DBLP DOI BibTeX RDF
28	Aurélie Lagoutte, Sébastien Tavenas	The complexity of Shortest Common Supersequence for inputs with no identical consecutive letters.	CoRR	2013	DBLP BibTeX RDF
28	Sayyed Rasoul Mousavi, Fateme Bahri, Farzaneh Tabataba	An enhanced beam search algorithm for the Shortest Common Supersequence Problem.	Eng. Appl. Artif. Intell.	2012	DBLP DOI BibTeX RDF
28	Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa 0001	Restricted Common Superstring and Restricted Common Supersequence.	CPM	2011	DBLP DOI BibTeX RDF
28	Jirí Kubalík	Evolutionary-based iterative local search algorithm for the shortest common supersequence problem.	GECCO	2011	DBLP DOI BibTeX RDF
28	Amihood Amir, Zvi Gotthilf, B. Riva Shalom	Weighted Shortest Common Supersequence.	SPIRE	2011	DBLP DOI BibTeX RDF
28	Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa 0001	Permuted Common Supersequence	CoRR	2010	DBLP BibTeX RDF
28	Suchithra Rajendran, Chandrasekharan Rajendran, Hans Ziegler	An Ant-Colony Algorithm to Transform Jobshops into Flowshops: A Case of Shortest-Common-Supersequence Stringology Problem.	BIONETICS	2010	DBLP DOI BibTeX RDF
28	Kang Ning 0001, Hon Wai Leong	Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm.	BMC Bioinform.	2006	DBLP DOI BibTeX RDF
28	Krzysztof Pietrzak	On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems.	J. Comput. Syst. Sci.	2003	DBLP DOI BibTeX RDF
28	Sven Rahmann	The shortest common supersequence problem in a microarray production setting.	ECCB	2003	DBLP BibTeX RDF
28	Paolo Barone, Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri	An approximation algorithm for the shortest common supersequence problem: an experimental analysis.	SAC	2001	DBLP DOI BibTeX RDF
28	Ambrose Kofi Laing, Robert Cypher	Deadlock-Free Routing in Arbitrary Networks via the Flattest Common Supersequence Method.	SPAA	1998	DBLP DOI BibTeX RDF
28	C. B. Fraser, Robert W. Irving	Approximation Algorithms for the Shortest Common Supersequence.	Nord. J. Comput.	1995	DBLP BibTeX RDF
28	Martin Middendorf	More on the Complexity of Common Superstring and Supersequence Problems.	Theor. Comput. Sci.	1994	DBLP DOI BibTeX RDF
28	Robert W. Irving, Campbell Fraser	On the Worst-Case Behaviour of Some Approximation Algorithms for the Shortest Common Supersequence of k Strings.	CPM	1993	DBLP DOI BibTeX RDF
28	Kari-Jouko Räihä, Esko Ukkonen	The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete.	Theor. Comput. Sci.	1981	DBLP DOI BibTeX RDF
19	Congnan Luo, Soon M. Chung	A scalable algorithm for mining maximal frequent sequences using a sample.	Knowl. Inf. Syst.	2008	DBLP DOI BibTeX RDF	Maximal frequent sequences, Data mining, Performance analysis, Sampling, Signatures, Prefix tree
19	Christian Blum 0001, Carlos Cotta, Antonio J. Fernández 0001, José E. Gallardo, Monaldo Mastrolilli	Hybridizations of Metaheuristics With Branch & Bound Derivates.	Hybrid Metaheuristics	2008	DBLP DOI BibTeX RDF
19	Vadim G. Timkovsky	Some Approximations for Shortest Common Nonsubsequences and Supersequences.	SPIRE	2008	DBLP DOI BibTeX RDF
19	Arianna Alfieri, Gaia Nicosia	Minimum cost multi-product flow lines.	Ann. Oper. Res.	2007	DBLP DOI BibTeX RDF	Flow lines optimization, Shortest path algorithms
19	José E. Gallardo, Carlos Cotta, Antonio J. Fernández 0001	On the Hybridization of Memetic Algorithms With Branch-and-Bound Techniques.	IEEE Trans. Syst. Man Cybern. Part B	2007	DBLP DOI BibTeX RDF
19	Costas S. Iliopoulos, M. Sohel Rahman, Michal Vorácek, Ladislav Vagner	The Constrained Longest Common Subsequence Problem for Degenerate Strings.	CIAA	2007	DBLP DOI BibTeX RDF
19	Eva K. Lee, Todd Easton, Kapil Gupta	Novel evolutionary models and applications to sequence alignment problems.	Ann. Oper. Res.	2006	DBLP DOI BibTeX RDF	Evolutionary distance problem, Minimum weight common mutated sequence, Node-packing polytope, Multiple sequence alignment, DNA sequencing, Sequence comparison, Conflict graph, Supernode, Phylogenetic analysis
19	Congnan Luo, Soon Myoung Chung	A Scalable Algorithm for Mining Maximal Frequent Sequences Using Sampling.	ICTAI	2004	DBLP DOI BibTeX RDF
19	Kamal Ali, Steven P. Ketchpel	Golden Path Analyzer: using divide-and-conquer to cluster Web clickstreams.	KDD	2003	DBLP DOI BibTeX RDF	clustering, Web-mining, divide-and-conquer
19	Kwang Mong Sim, Weng Hong Sun	Multiple Ant-Colony Optimization for Network Routing.	CW	2002	DBLP DOI BibTeX RDF
19	Kwang Mong Sim, Weng Hong Sun	A Comparative Study of ANT-Based Optimization for Dynamic Routing.	Active Media Technology	2001	DBLP DOI BibTeX RDF
19	Martin Middendorf	On the Approximation of Finding Various Minimal, Maximal, and Consistent Sequences.	ISAAC	1994	DBLP DOI BibTeX RDF