نتایج جستجو برای: complexity of algorithms

تعداد نتایج: 21191015  

Journal: :RAIRO - Theoretical Informatics and Applications 2011

Journal: :Journal of Graph Algorithms and Applications 2012

Journal: :SN computer science 2022

Despite the recent progress in genome sequencing and assembly, many of currently available assembled genomes come a draft form. Such consist large number genomic fragments (scaffolds), whose order and/or orientation (i.e., strand) are unknown. There exist various scaffold assembly methods, which attempt to determine scaffolds along chromosomes. Some these methods (e.g., based on FISH physical m...

Journal: :The Journal of the Institute of Television Engineers of Japan 1996

Journal: :European Journal of Operational Research 1992

Journal: :Journal of Symbolic Computation 2006

Journal: :International Journal of Algebra and Computation 2019

Journal: :Computational Geometry: Theory and Applications 2023

We consider the problem of untangling a given (non-planar) straight-line circular drawing δG an outerplanar graph G=(V,E) into planar G by shifting minimum number vertices to new position on circle. For G, it is obvious that such crossing-free always exists and we define shift∘(δG) as are required be shifted in order resolve all crossings δG. show Circular Untangling, asking whether shift∘(δG)≤...

In this paper, a new approach for estimating the number of wideband sources is proposed which is based on RSS or ISM algorithms. Numerical results show that the MDL-based and EIT-based proposed algorithm havea much better detection performance than that in EGM and AIC cases for small differences between the incident angles of sources. In addition, for similar conditions, RSS algorithm offers hi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید