Elibrary Perpustakaan Universitas Riau

Ebook, artikel jurnal dan artikel ilmiah

  • Beranda
  • Informasi
  • Berita
  • Bantuan
  • Pustakawan
  • Area Anggota
  • Pilih Bahasa :
    Bahasa Arab Bahasa Bengal Bahasa Brazil Portugis Bahasa Inggris Bahasa Spanyol Bahasa Jerman Bahasa Indonesia Bahasa Jepang Bahasa Melayu Bahasa Persia Bahasa Rusia Bahasa Thailand Bahasa Turki Bahasa Urdu

Pencarian berdasarkan :

SEMUA Pengarang Subjek ISBN/ISSN Pencarian Spesifik

Pencarian terakhir:

{{tmpObj[k].text}}
No image available for this title
Penanda Bagikan

e-journal

Constructing a Gene Team Tree in Almost Oðn lg nÞ Time

Biing-Feng Wang - Nama Orang; Chien-Hsin Lin - Nama Orang; I-Tse Yang - Nama Orang;

An important model of a conserved gene cluster is called the gene team model, in which a chromosome is defined to be a permutation of distinct genes and a gene team is defined to be a set of genes that appear in two or more species, with the distance between adjacent genes in the team for each chromosome always no more than a certain threshold d. A gene team tree is a succinct way to represent all gene teams for every possible value of d. The previous fastest algorithm for constructing a gene team tree of two
chromosomes requires Oðn lg n lglg nÞ time, which was given by Wang and Lin. Its bottleneck is a problem called the maximum-gap problem. In this paper, by presenting an improved algorithm for the maximum-gap problem, we reduce the upper bound of the gene team tree problem to Oðn lg n aðnÞÞ. Since a grows extremely slowly, this result is almost as efficient as the current best upper bound, Oðn lg nÞ, for finding the gene teams of a fixed d value. Our new algorithm is very efficient from both the theoretical and practical points of view. Wang and Lin’s gene-team-tree algorithm can be extended to k chromosomes with complexity Oðkn lg n lglg nÞ. Similarly, our improved algorithm for the maximum-gap problem reduces this running time to Oðkn lg n aðnÞÞ. In addition, it also provides new upper bounds for the gene team tree problem on general sequences, in which multiple copies of the same gene are allowed.
Index Terms—Algorithms, data structures, gene teams, comparative genomics, conserved gene clusters


Ketersediaan

Tidak ada salinan data

Informasi Detail
Judul Seri
IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS
No. Panggil
-
Penerbit
New York : IEEE., 2014
Deskripsi Fisik
IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL. 11, NO. 1, JANUARY/FEBRUARY 2014
Bahasa
English
ISBN/ISSN
1545-5963
Klasifikasi
-
Tipe Isi
-
Tipe Media
-
Tipe Pembawa
-
Edisi
VOL. 11, NO. 1, JANUARY/FEBRUARY 2014
Subjek
BIOLOGI
Info Detail Spesifik
-
Pernyataan Tanggungjawab
Yuli/Agus
Versi lain/terkait

Tidak tersedia versi lain

Lampiran Berkas
  • FULL TEXT. Constructing a Gene Team Tree in Almost Oðn lg nÞ Time
Komentar

Anda harus masuk sebelum memberikan komentar

Elibrary Perpustakaan Universitas Riau
  • Informasi
  • Layanan
  • Pustakawan
  • Area Anggota

Tentang Kami

As a complete Library Management System, SLiMS (Senayan Library Management System) has many features that will help libraries and librarians to do their job easily and quickly. Follow this link to show some features provided by SLiMS.

Cari

masukkan satu atau lebih kata kunci dari judul, pengarang, atau subjek

Donasi untuk SLiMS Kontribusi untuk SLiMS?

© 2025 — Senayan Developer Community

Ditenagai oleh SLiMS
Pilih subjek yang menarik bagi Anda
  • Karya Umum
  • Filsafat
  • Agama
  • Ilmu-ilmu Sosial
  • Bahasa
  • Ilmu-ilmu Murni
  • Ilmu-ilmu Terapan
  • Kesenian, Hiburan, dan Olahraga
  • Kesusastraan
  • Geografi dan Sejarah
Icons made by Freepik from www.flaticon.com
Pencarian Spesifik
Kemana ingin Anda bagikan?