Search Results - "Space-efficient algorithm"

Refine Results
  1. 1
  2. 2

    Influence Maximization: A Time-Space Efficient Algorithm by Xia, Ganming

    ISSN: 1757-8981, 1757-899X
    Published: Bristol IOP Publishing 01.05.2019
    “… We proposed a new algorithm TESA (Time-Space Efficient Algorithm). On large social networks, TESA saves more space than existing algorithms and runs faster…”
    Get full text
    Journal Article
  3. 3

    A space-efficient algorithm for finding strongly connected components by Pearce, David J.

    ISSN: 0020-0190, 1872-6119
    Published: Amsterdam Elsevier B.V 01.01.2016
    Published in Information processing letters (01.01.2016)
    “…Tarjan's algorithm for finding the strongly connected components of a directed graph is widely used and acclaimed. His original algorithm required at most…”
    Get full text
    Journal Article
  4. 4

    A space efficient algorithm for the longest common subsequence in k-length substrings by Zhu, Daxin, Wang, Lei, Wang, Tinran, Wang, Xiaodong

    ISSN: 0304-3975, 1879-2294
    Published: Elsevier B.V 29.07.2017
    Published in Theoretical computer science (29.07.2017)
    “…Two space efficient algorithms to solve the LCSk problem and LCS≥k problem are presented in this paper…”
    Get full text
    Journal Article
  5. 5
  6. 6

    Space-efficient algorithm for computing a centerpoint of a set of points in R2 by Bhattacharya, Binay K., Nandy, Subhas C., Roy, Sasanka

    ISSN: 0304-3975, 1879-2294
    Published: Elsevier B.V 15.02.2016
    Published in Theoretical computer science (15.02.2016)
    “…We study a space-efficient algorithm for computing a centerpoint for a set P of n points in R2, where the points in P are given in a read-only array…”
    Get full text
    Journal Article
  7. 7

    Space-efficient algorithm for computing a centerpoint of a set of points in by Bhattacharya, Binay K, Nandy, Subhas C, Roy, Sasanka

    ISSN: 0304-3975
    Published: 01.02.2016
    Published in Theoretical computer science (01.02.2016)
    “…We study a space-efficient algorithm for computing a centerpoint for a set P of n points in , where the points in P are given in a read-only array…”
    Get full text
    Journal Article
  8. 8
  9. 9

    A space-efficient algorithm for sequence alignment with inversions and reversals by Chen, Zhi-Zhong, Gao, Yong, Lin, Guohui, Niewiadomski, Robert, Wang, Yang, Wu, Junfeng

    ISSN: 0304-3975, 1879-2294
    Published: Amsterdam Elsevier B.V 06.10.2004
    Published in Theoretical computer science (06.10.2004)
    “… We develop a space-efficient algorithm to compute such an optimal alignment which consumes only O ( nm…”
    Get full text
    Journal Article Conference Proceeding
  10. 10

    Longest common subsequence in sublinear space by Kiyomi, Masashi, Horiyama, Takashi, Otachi, Yota

    ISSN: 0020-0190
    Published: Elsevier B.V 01.06.2021
    Published in Information processing letters (01.06.2021)
    “…•The first o(n)-space polynomial-time algorithm for the longest common subsequence problem is presented.•Levenshtein distance can be computed in the same time…”
    Get full text
    Journal Article
  11. 11

    A space-efficient algorithm for local similarities by Huang, Xiaoqiu, Hardison, Ross C., Miller, Webb

    ISSN: 1367-4803, 0266-7061, 1460-2059
    Published: Washington, DC Oxford University Press 01.10.1990
    Published in Bioinformatics (01.10.1990)
    “…Existing dynamic-programming algorithms for identifying similar regions of two sequences require time and space proportional to the product of the sequence…”
    Get full text
    Journal Article
  12. 12

    A space-efficient algorithm for aligning large genomic sequences by Morgenstern, Burkhard

    ISSN: 1367-4803, 1460-2059, 1367-4811
    Published: Oxford Oxford University Press 01.10.2000
    Published in Bioinformatics (01.10.2000)
    “…In the segment-by-segment approach to sequence alignment, pairwise and multiple alignments are generated by comparing gap-free segments of the sequences under…”
    Get full text
    Journal Article
  13. 13

    Space-Efficient Algorithm for Integer Programming with Few Constraints by Rohwedder, Lars, Węgrzycki, Karol

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 05.09.2024
    Published in arXiv.org (05.09.2024)
    “…Integer linear programs \(\min\{c^T x : A x = b, x \in \mathbb{Z}^n_{\ge 0}\}\), where \(A \in \mathbb{Z}^{m \times n}\), \(b \in \mathbb{Z}^m\), and \(c \in…”
    Get full text
    Paper
  14. 14

    A Generalized Space-Efficient Algorithm for Quantum Bit String Comparators by Shahzad, Khuram, Khan, Omar Usman

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 14.11.2023
    Published in arXiv.org (14.11.2023)
    “…Quantum Bit String Comparators (QBSC) operate on two sequences of n-qubits, enabling the determination of their relationships, such as equality, greater than,…”
    Get full text
    Paper
  15. 15

    Space-Efficient Algorithms for Longest Increasing Subsequence by Kiyomi, Masashi, Ono, Hirotaka, Otachi, Yota, Schweitzer, Pascal, Tarui, Jun

    ISSN: 1432-4350, 1433-0490
    Published: New York Springer US 01.04.2020
    Published in Theory of computing systems (01.04.2020)
    “…Given a sequence of integers, we want to find a longest increasing subsequence of the sequence. It is known that this problem can be solved in O n log n time…”
    Get full text
    Journal Article
  16. 16
  17. 17

    A space-efficient algorithm for three sequence alignment and ancestor inference by Yue, Feng, Tang, Jijun

    ISSN: 1748-5673
    Published: Switzerland 01.01.2009
    “…We propose a novel algorithm to simultaneously align three biological sequences with affine gap model and infer their common ancestral sequence. It applies the…”
    Get more information
    Journal Article
  18. 18

    A space-efficient algorithm for the constrained pairwise sequence alignment problem by He, Dan, Arslan, Abdullah N

    ISSN: 0919-9454
    Published: Japan 2005
    “…The constrained pairwise sequence alignment (CPSA) problem aims to align two given sequences by aligning their similar subsequences in the same region under…”
    Get more information
    Journal Article
  19. 19

    A space efficient algorithm for finding the best nonoverlapping alignment score by Benson, Gary

    ISSN: 0304-3975, 1879-2294
    Published: Amsterdam Elsevier B.V 10.07.1995
    Published in Theoretical computer science (10.07.1995)
    “… In this paper, we present a space efficient algorithm for finding the maximum alignment score for any two substrings of a single string T under the condition that the substrings do not overlap…”
    Get full text
    Journal Article
  20. 20

    Time and space efficient algorithm for consumer's priority product management by Al-Ameen, Mahdi Nasrullah, Shahriar, Mehrab, Billah, Adip

    ISBN: 1467348333, 9781467348331
    Published: IEEE 01.12.2012
    “…In this highly competitive free market economy, the test or interest of a certain consumer plays a momentous role for the business organizations to select…”
    Get full text
    Conference Proceeding