咨询与建议

限定检索结果

文献类型

  • 75 篇 期刊文献
  • 20 篇 会议
  • 1 篇 学位论文

馆藏范围

  • 96 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 80 篇 工学
    • 77 篇 计算机科学与技术...
    • 18 篇 软件工程
    • 3 篇 电气工程
    • 1 篇 化学工程与技术
    • 1 篇 生物医学工程(可授...
    • 1 篇 生物工程
  • 56 篇 理学
    • 53 篇 数学
    • 6 篇 生物学
    • 3 篇 统计学(可授理学、...
    • 1 篇 化学
  • 9 篇 管理学
    • 9 篇 管理科学与工程(可...
    • 5 篇 工商管理
  • 5 篇 经济学
    • 5 篇 应用经济学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 农学
  • 1 篇 医学
    • 1 篇 基础医学(可授医学...

主题

  • 96 篇 parameterized al...
  • 11 篇 approximation al...
  • 7 篇 vertex cover
  • 6 篇 exact algorithm
  • 6 篇 kernelization
  • 5 篇 edge dominating ...
  • 5 篇 dynamic programm...
  • 4 篇 clustering
  • 4 篇 haplotype
  • 4 篇 randomized algor...
  • 3 篇 computational co...
  • 3 篇 pattern matching
  • 3 篇 tree decompositi...
  • 3 篇 genotype
  • 3 篇 independent set
  • 3 篇 fixed-parameter ...
  • 3 篇 enumeration
  • 3 篇 graph modificati...
  • 3 篇 representative f...
  • 3 篇 alignment networ...

机构

  • 8 篇 texas a&m univ d...
  • 8 篇 cent s univ sch ...
  • 7 篇 texas a&m univ d...
  • 4 篇 chalmers univ de...
  • 4 篇 technion israel ...
  • 4 篇 univ bergen berg...
  • 3 篇 jiangsu univ sci...
  • 3 篇 depaul univ sch ...
  • 3 篇 natl chung cheng...
  • 3 篇 hunan normal uni...
  • 3 篇 technion israel ...
  • 3 篇 cent south univ ...
  • 3 篇 univ elect sci &...
  • 2 篇 univ calif irvin...
  • 2 篇 shandong univ sc...
  • 2 篇 eindhoven univ t...
  • 2 篇 hunan univ techn...
  • 2 篇 cent south univ ...
  • 2 篇 univ utrecht dep...
  • 2 篇 ben gurion univ ...

作者

  • 15 篇 chen jianer
  • 14 篇 zehavi meirav
  • 14 篇 wang jianxin
  • 6 篇 feng qilong
  • 6 篇 shachnai hadas
  • 6 篇 song yinglei
  • 5 篇 damaschke peter
  • 4 篇 saurabh saket
  • 4 篇 xie minzhu
  • 4 篇 pinter ron y.
  • 3 篇 wu bang ye
  • 3 篇 chen li-hsuan
  • 3 篇 ono hirotaka
  • 3 篇 liu chunmei
  • 3 篇 xia ge
  • 3 篇 hanaka tesshu
  • 3 篇 xu chao
  • 3 篇 lokshtanov danie...
  • 3 篇 xiao mingyu
  • 2 篇 li wenjun

语言

  • 87 篇 英文
  • 9 篇 其他
检索条件"主题词=Parameterized algorithm"
96 条 记 录,以下是91-100 订阅
排序:
Research on parameterized algorithms of the individual haplotyping problem
收藏 引用
Journal of Bioinformatics and Computational Biology 2007年 第3期5卷 795-816页
作者: Xie, Minzhu Chen, Jian'er Wang, Jianxin School of Information Science and Engineering Central South University Changsha Hunan Province 410083 China College of Physics and Information Science Hunan Normal University Changsha Hunan Province 410083 China
The individual haplotyping problem is a computing problem of reconstructing two haplotypes for an individual based on several optimal criteria from one's fragments sequencing data. This paper is based on the fact ... 详细信息
来源: 评论
Parametric duality and kernelization: Lower bounds and upper bounds on kernel size
收藏 引用
SIAM JOURNAL ON COMPUTING 2007年 第4期37卷 1077-1106页
作者: Chen, Jianer Fernau, Henning Kanj, Iyad A. Xia, Ge Depaul Univ Sch CTI Chicago IL 60604 USA Univ Trier Abt Informat FB 4 D-54286 Trier Germany Texas A&M Univ Dept Comp Sci College Stn TX 77843 USA Lafayette Coll Acopian Engn Ctr Dept Comp Sci Easton PA 18042 USA
Determining whether a parameterized problem is kernelizable and has a small kernel size has recently become one of the most interesting topics of research in the area of parameterized complexity and algorithms. Theore... 详细信息
来源: 评论
Efficient parameterized algorithms for biopolymer structure-sequence alignment
收藏 引用
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2006年 第4期3卷 423-432页
作者: Song, Yinglei Liu, Chunmei Huang, Xiuzhen Malmberg, Russell L. Xu, Ying Cai, Liming Univ Georgia Dept Comp Sci Athens GA 30602 USA Arkansas State Univ Dept Comp Sci State Univ AR 72467 USA Univ Georgia Dept Plant Biol Athens GA 30602 USA Univ Georgia Dept Biochem & Mol Biol Athens GA 30602 USA
Computational alignment of a biopolymer sequence (e. g., an RNA or a protein) to a structure is an effective approach to predict and search for the structure of new sequences. To identify the structure of remote homol... 详细信息
来源: 评论
Efficient parameterized algorithms for biopolymer structure-sequence alignment
Efficient parameterized algorithms for biopolymer structure-...
收藏 引用
5th International Workshop on algorithms in Bioinformatics (WABI 2005)
作者: Song, Yinglei Liu, Chunmei Huang, Xiuzhen Malmberg, Russell L. Xu, Ying Cai, Liming Univ Georgia Dept Comp Sci Athens GA 30602 USA Arkansas State Univ Dept Comp Sci State Univ AR 72467 USA Univ Georgia Dept Plant Biol Athens GA 30602 USA Univ Georgia Dept Biochem & Mol Biol Athens GA 30602 USA
Computational alignment of a biopolymer sequence (e. g., an RNA or a protein) to a structure is an effective approach to predict and search for the structure of new sequences. To identify the structure of remote homol... 详细信息
来源: 评论
Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems
收藏 引用
algorithmICA 2005年 第4期43卷 245-273页
作者: Chen, JN Kanj, IA Xia, G Texas A&M Univ Dept Comp Sci College Stn TX 77843 USA DePaul Univ Sch CTI Chicago IL 60604 USA
A sequence of exact algorithms to solve the VERTEX COVER and MAXIMUM INDEPENDENT SET problems have been proposed in the literature. All these algorithms appeal to a very conservative analysis that considers the size o... 详细信息
来源: 评论
An improved algorithm for the jump number problem
收藏 引用
INFORMATION PROCESSING LETTERS 2001年 第2期79卷 87-92页
作者: McCartin, C Victoria Univ Wellington Sch Math & Comp Sci Wellington New Zealand
The "jump number scheduling problem" has been shown to be NP-complete. However, for a fixed parameter k, El-Zahar and Schmerl show that the decision problem "is the jump number less than or equal to k?&... 详细信息
来源: 评论