首页> 外文OA文献 >Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence

【2h】

Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence

机译：计算一个按符号表示的全有序有向无环图和一个序列的最长拓扑公共子序列

代理获取

本网站仅为用户提供外文OA文献查询和代理获取服务，本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文，但由于OA文献来源多样且变更频繁，仍可能出现获取不到、文献不完整或与标题不符等情况，如果获取不到我们将提供退款服务。请知悉。

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
Sakai Yoshifumi;
展开▼
作者单位

展开▼
年度 2009
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence [J] . Yoshifumi Sakai Theoretical computer science . 2009,第27a29期

机译：计算一个按符号表示的全有序无环图和一个序列的最长拓扑公共子序列
2. A scalable approach to computing representative lowest common ancestor in directed acyclic graphs [J] . Santanu Kumar Dash, Sven-Bodo Scholz, Stephan Herhut, Theoretical computer science . 2013,第Null期

机译：计算有向无环图中代表性最小公祖的可扩展方法
3. NP-HARDNESS AND FIXED-PARAMETER TRACTABILITY OF REALIZING DEGREE SEQUENCES WITH DIRECTED ACYCLIC GRAPHS [J] . Hartung Sepp, Nichterlein Andre SIAM Journal on Discrete Mathematics . 2015,第4期

机译：带有直接循环图的实现度序列的NP硬度和固定参数可追踪性
4. Computing Lowest Common Ancestors in Directed Acyclic Graphs [C] . Yijie Han International Conference on Computers and Their Applications . 2007

机译：计算在指示的非循环图中的最低公共祖先
5. Explorations on the longest common increasing subsequence problem. [D] . Bai, Yongsheng. 2002

机译：关于最长的共同递增子序列问题的探索。
6. Corrigendum to: Evidence synthesis for constructing directed acyclic graphs (ESC-DAGs): a novel and systematic method for building directed acyclic graphs [O] . Karl D Ferguson, Mark McCann, Srinivasa Vittal Katikireddi, -1

机译：勘误：构造有向无环图（ESC-DAG）的证据综合：建立有向无环图的一种新颖而系统的方法
7. Directed acyclic subsequence graph---overview [O] . Crochemore, M, Melichar, B, Tronek, Z 2003

机译：有向无环子序列图---概述

Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence

著录项

引文网络

相似文献

相关主题

期刊订阅