Non-Universality for Longest Increasing Subsequence of a Random Walk

Alea - Brazil
doi 10.30757/alea.v14-18
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute for Applied and Pure Mathematics (IMPA)

Related search

Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Computer NetworksOpticsMolecular Physics,CommunicationsOpticalAtomicMagnetic MaterialsElectronic
2007English

Beam Search for the Longest Common Subsequence Problem

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2009English

A Comprehensive Comparison of Metaheuristics for the Repetition-Free Longest Common Subsequence Problem

Journal of Heuristics
ControlInformation SystemsManagement ScienceComputer NetworksCommunicationsOptimizationOperations ResearchArtificial IntelligenceSoftware
2017English

Acceleration of Sequence Clustering Using Longest Common Subsequence Filtering

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2013English

A GPU Implementation of a Bit-Parallel Algorithm for Computing the Longest Common Subsequence

IPSJ Online Transactions
2014English

Bounds on the Complexity of the Longest Common Subsequence Problem

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1976English

Reducing Approximate Longest Common Subsequence to Approximate Edit Distance

2020English

Non Symmetric Random Walk on Infinite Graph

Opuscula Mathematica
Mathematics
2011English

Hybrid Techniques Based on Solving Reduced Problem Instances for a Longest Common Subsequence Problem

Applied Soft Computing Journal
Software
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy