找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Combinatorial Pattern Matching; 6th Annual Symposium Zvi Galil,Esko Ukkonen Conference proceedings 1995 Springer-Verlag Berlin Heidelberg 1

[復制鏈接]
樓主: 憑票入場
51#
發(fā)表于 2025-3-30 10:30:09 | 只看該作者
52#
發(fā)表于 2025-3-30 13:27:57 | 只看該作者
Off-Grid Green Hydrogen Production Systemsotein structures. This report focuses on the identification and matching of common substructures, and treats two problems: the probing of a database of structures with a segment of a protein to identify regions from other proteins with conformations similar to that of the probe, and the determinatio
53#
發(fā)表于 2025-3-30 17:34:19 | 只看該作者
Off-Grid Green Hydrogen Production Systemsll. A brief survey on the biological macromolecules and their function is given. Sequence data analysis is introduced as a basic tool for the experimental bench biologist. So far, most queries for such analyses are issued on flat files and static indices. We discuss position tree structures and thei
54#
發(fā)表于 2025-3-30 22:49:57 | 只看該作者
55#
發(fā)表于 2025-3-31 04:01:39 | 只看該作者
56#
發(fā)表于 2025-3-31 08:01:17 | 只看該作者
Smart Grids: Security and Privacy IssuesThe suffix cactus is a new alternative to the suffix tree and the suffix array as an index of large static texts. Its size and its performance in searches lies between those of the suffix tree and the suffix array. Structurally, the suffix cactus can be seen either as a compact variation of the suffix tree or as an augmented suffix array.
57#
發(fā)表于 2025-3-31 12:37:53 | 只看該作者
Common subsequences and supersequences and their expected length,Let . be the expected length of a longest common subsequence of . sequences of length . over an alphabet of size .. It is known that there are constants .. such that ..., we show that ..=..). Bounds for the corresponding constants for the expected length of a shortest common supersequence are also presented.
58#
發(fā)表于 2025-3-31 14:52:37 | 只看該作者
59#
發(fā)表于 2025-3-31 20:57:34 | 只看該作者
60#
發(fā)表于 2025-3-31 22:37:18 | 只看該作者
Combinatorial Pattern Matching978-3-540-49412-6Series ISSN 0302-9743 Series E-ISSN 1611-3349
 關于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結 SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-25 06:48
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
鞍山市| 隆化县| 孟州市| 襄樊市| 达日县| 盘山县| 桐城市| 英吉沙县| 马尔康县| 嘉峪关市| 中方县| 依安县| 钟山县| 正安县| 阿图什市| 赤城县| 张家界市| 甘德县| 甘泉县| 调兵山市| 高台县| 伊吾县| 湖州市| 彭水| 南充市| 景谷| 安国市| 海伦市| 桂林市| 承德县| 娄底市| 尼勒克县| 含山县| 九寨沟县| 丹凤县| 肇庆市| 盘山县| 湖北省| 武宁县| 陇川县| 许昌县|